资源列表
0-1hs
- 0-1背包问题-回溯法,算法设计课程作业-0-1 knapsack problem- Backtracking algorithm design course work
0-1cc
- 0-1背包问题-分支限界法,算法设计课程作业-0-1 knapsack problem- branch and bound algorithm design course work
0-1
- 0-1 背包问题-动态规划法,算法设计课程作业-0-1 knapsack problem- dynamic programming, algorithm design course work
cc
- 全排列 字典序 生成 算法 实现-The whole arranged in the lexicographical generation algorithm
gty
- 编写一个程序实现堆排序过程,并输出{6,8,7,9,0,1,3,2,4,5}的排序过程-Sorting process to write a program to heap sort process, and output {6,8,7,9,0,1,3,2,4,5}
shortest
- 最短路径算法的实现，通过全国省会的联系关系来实例说明-The shortest path algorithm, to examples of contact between the capital of the country
experiment1
- 对一组没有顺序的整数进行排序，并且是排序后的一组数呈从左到右一次增大-A group of the number of sort
Algorithm_SA
- 用java实现的线性序列对齐算法（算法->动态规划的作业）-Java implementation of a linear sequence alignment algorithm (algorithm- dynamic programming job)
BinarySearch
- 动态实现了二叉树的构建和4种遍历算法以及平衡二叉树的构建-Realize the tranfer of binary tree with four styles and balance binary tree creation
DATE
- 一道ACM的日历问题的答案，可计算规定日期的任何一天-An ACM' s calendar answer to that question can be calculated on any given day of the specified date
FixLineLenFileMan
- 操作固定长度的行的文件。长度可自己设置。-Operating the line of fixed-length file. The length can be set.
Singlelist
- 单链表操作类。可设置链表长度，利用头尾指针来加快查找速度-Single linked list manipulation classes. Can be set to the linked list length, the use of the head and tail pointers to accelerate the search speed