资源列表
c
- 对以下六种常用的内部排序算法进行比较：希尔排序、直接选择排序、快速排序、直接插入排序、堆排序、冒泡排序、。 （2）待排序表的表长和数据可以由用户自己确定，也可以由随机数产生程序自动产生；至少要用五组不同的输入数据作比较；比较的指标为关键字的比较次数和关键字的移动次数（关键字的交换计为三次移动）。 （3）最后要对结果作出简单分析。 -Six commonly used internal sorting algorithm: Hill Sort by direct selection s
maopao
- 冒泡排序，一种适合元素多的排序方法，最基本的排序之一-Bubble Sort, a suitable number of elements sorted by one of the most basic sort
ab
- 要求利用插入运算建立线性链表，完成链表的查找、删除等运算-To insert the operator to establish the linear list, complete the linked list to find, delete operations
Cpp2
- 要求利用插入运算建立线性链表，完成链表的查找、删除等运算-To insert the operator to establish the linear list, complete the linked list to find, delete operations
Cpp1
- 要求利用插入运算建立线性链表，完成链表的查找、删除等运算-To insert the operator to establish the linear list, complete the linked list to find, delete operations
tree
- 关于二叉树的一些函数，判断是否为二叉树、把二叉排序树S合并到T中、把树结点S插入到T的合适位置上-Some function on a binary tree
fzxj
- 分支限界法解决单源最短路径问题(xiaodan)-Branch and bound method to solve the single source shortest path problem (xiaodan)
zuixiaoshenchengshushili
- 若要在n个城市之间修路，只需修n-1条线路即可。如何以最低的经济代价建设，是一个网的最小生成树-To n-1 lines, to between n cities, roads, just repair. The lowest economic cost of construction, the minimum spanning tree of a network
(Kruskal
- 若要在6个城市之间建立通信网络，只需要架设5条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题-To establish communication networks between 6cities, only need to set up the 5 lines can be. The lowest economic cost of construction communication network is a network of minimum spanning tr
Kruskal.zuixiaoshengchengshu
- 若要在n个城市之间建立通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题-To establish communication networks between n cities, only need to set up the n-1 lines can be. The lowest economic cost of construction communication network is a network of minimum spanni
Data-structure
- 数据结构课程设计 包括单链表,二叉树,拓扑排序,最小生成树,内部排序,表达式求值-The data structure curriculum includes the singly linked lists, binary trees, topological sort, minimum spanning tree, internal sequencing, expression evaluation
Range-search-of-Binary-search
- 使用折半查找法来确定一定范围，即折半查找的范围查找。-Use binary search to determine a certain range, ie, a binary search range to find.