资源列表
Knapsacktwoinone
- 0-1背包和 背包问题的动态规划 源程序 只是测试 不过要自己输入 还要自己加入 很简单就没有更改-0-1 knapsack problem knapsack and the dynamic programming source code is to test but also to input their own entry is very there is no simple changes
Calculationsme
- 用线性表实现四则运算，很好的一个版本，老师给了满分-achieve linear Table 4 operation, a very good version, the teacher gave full marks
guahaotest
- 学习C语言时，编写的一个多项式刮号检查程序 主要用栈实现的。-C language study, prepared by a polynomial scratching, the main inspection procedures Stack realized.
jiayou
- 用C语言实现的算法题中的加油问题。 用贪心算法实现的。-C language algorithms that the refueling problem. With the greedy algorithm.
priority_queues
- 是个HEAP SORT 算法..对一个数列进行HEAP SORT -is SORT algorithm Rd .. right for a series Rd SORT
genericalgorithm
- 一个实现基因表达式编程来解决函数发现问题的小程序-a realization of gene expression programming to solve the problems identified in the function of small procedures
chenzhong_register_source
- 初学者的源c代码，一共5个，主要是c基础,包括文件操作。-c beginners source code, a total of five, mainly c base, including file operations.
ListDemoLBYS
- 这是我帮同学做的一个链表操作的演示程序，可以模拟链表的插入删除-This is what I do to help students operate a chain of demonstration program, it is possible to simulate the insertion deletion Chain
cnlong
- long bei ge suan fa 龙算法-long bei ge suan fa Long algorithm
4_25
- 给定一个n位正整数a，去掉其中任意k<=n个数字后，剩下的数字按原次序排列成一个新的正整数。对于给定的n位正整数a和正整数k，设计一个算法找出剩下数字组成的新数最小的删数方案。-given a positive integer n-a, which removed arbitrary k
2_8
- 设n个不同的整数排好序后存于T[0:n-1]中。若存在一个下标I,0<I<n,使得t[I]=I,设计一个有效算法找到这个下标。要求算法在最坏情况下的计算时间为O(logn).-Let n different integer sequence after arranging deposit T [0 : n-1]. If there is a subscr ipt I, 0
31yn
- 设计一个O(n2)时间的算法，找出由n个数组成的序列的最长单调递增子序列。-design an O (n2) time algorithm to identify by the number n of the longest sequence monotonically increasing sequences.