资源列表
knapsack
- 九讲背包问题。一本很好的算法书，详细讲解了背包问题。-Nine speakers knapsack problem. A good algorithm book, explain in detail the knapsack problem.
HorseTravel
- 用预见算法解骑士游历问题，JAVA数据结构的课后实例，希望对大家有所帮助-Knight traveled with predictable algorithm for solving the problem, JAVA instance of the data structure after school, we want to help
mergesort
- 归并排序，C代码，初学者可以看一下，大家分享一下-Merge sort, C code, and beginners can take a look, we share with you
redblacktree
- 算法导论之红黑树算法，红黑树主要用在内核的算法，该算法的时间复杂度很好！-Introduction to the red and black tree algorithm algorithm, a red, black tree in the main core of the algorithm time complexity good!
Queue
- 队列的代码实现，VC++开发平台，C语言描述的数据结构。-The queue code, VC++ development platform, the C language to describe the data structure.
peng
- 建立顺序表，完成顺序表的基本操作：初始化、插入、删除、输出（遍历）、销毁, 置空表、求表长、查找元素、判线性表是否为空等。-Establish the order form, complete the order form the basic operations: initialization, insert, delete, output (traverse), destroyed, blank table, find the length of the table, find elemen
while
- 在C语言编程中，while 循环语句的使用课件及详解 。-In the C programming language, the use of the while loop courseware and Detailed.
VCFINDPT
- VC游戏编写中的求解最短路径算法源码，本示例是自动寻径演示，篮点是起点，红点是终点，按确定键开始。源码爱好者注：编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中，若不然会出错-VC games in preparation for solving the shortest path algorithm source code, this example is the automatic routing demonstration of basket is that starti
xiaoyuan-daoyou
- 最短寻路算法的实现和使用 校园导游 数据结构课程设计 vc++控制台程序 可以读文件初始化-campus guider
huofuman
- 霍夫曼编码的基本方法是先对图像数据扫描一遍，计算出各种像素出现的概率，按概率的大小指定不同长度的唯一码字，由此得到一张该图像的霍夫曼码表。编码后的图像数据记录的是每个像素的码字，而码字与实际像素值的对应关系记录在码表中。-Huffman coding method is first scanned image data again, to calculate the probability of a variety of pixel specify a different length uniq
gray
- Gray码是一个长度为2n的序列。序列中无相同元素，每个元素都是长度为n位的串，相邻元素恰好只有1位不同。用分治策略设计并实现一个算法对任意的n构造响应的Gray码。-Gray code is a sequence of length 2n. No similar sequence elements, each element is n-bit string length, the adjacent element is only a difference exactly. With sub-r
MatrixMultiply
- 算法设计与分析 王晓东版的 矩阵连乘的动态规划法和备忘录法的实现-Algorithm Design and Analysis Xiaodong version of the matrix continued by the dynamic programming method and the realization of Memorandum of Law