-
shellpaixu
希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进(双语对照查看希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进。
Hill sorting (Shell Sort) is a kind of insertion sort. Is to improve the direct insertion sort algorithm.
)
- 2013-07-18 15:11:39下载
- 积分:1
-
host2
说明: 马踏棋盘算法编程,实现在棋盘上任意两点间的最短路径求解。(horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.)
- 2006-04-30 00:12:21下载
- 积分:1
-
maze
说明: 由数字1和0组成迷宫,0代表可走路径,程序会用坐标的形式给出每一步的走法(Composed by a maze of numbers 1 and 0, 0 to go the path, the program will use the coordinates given in the form of moves at each step)
- 2011-03-27 20:57:47下载
- 积分:1
-
heapSort.cpp.tar
这是一个堆排序的算法源程序,算法被单独写成一个函数,希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)
- 2013-12-12 14:52:48下载
- 积分:1
-
heapSort.cpp.tar
这是一个堆排序的算法源程序,算法被单独写成一个函数,希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)
- 2013-12-12 14:52:48下载
- 积分:1
-
jiajianfa
长整数四则运算,利用双向循环链表实现长整数的存储,每个结点含一个整形变量。
(Long integer arithmetic, the use of two-way circular linked list to achieve long integer storage, each node contains an integer variable.)
- 2014-05-29 14:41:51下载
- 积分:1
-
huffman
使用C语言完成党的霍夫曼编码,主要使用树的数据结构,作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)
- 2013-07-15 23:59:47下载
- 积分:1
-
太阳能电池参数计算器 升级版
太阳能电池参数计算,可以快速方便计算电流,电压,填充因子等参数(Solar cell parameter calculation)
- 2017-11-23 21:30:46下载
- 积分:1
-
sort
自己编写的几种经典的排序算法,里面有自己做的PPT详细讲解,希望有帮助吧(I have written several classic sorting algorithm, which own PPT explain in detail, I hope to help!)
- 2012-08-28 09:31:28下载
- 积分:1
-
2.2
已知线性表中的元素以值递增有序排列,并以单链表作存储结构。试写一高效的算法,删除表中所有值大于mink且小于maxk的元素(若表中存在这样的元素)同时释放被删结点空间,并分析你的算法的时间复杂度(注意:mink和maxk是给定的两个参变量,它们的值可以和表中的元素相同,也可以不同)。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values and elements in the table can be the same or different).)
- 2015-04-11 23:11:41下载
- 积分:1