资源列表
hafumanshu
- 数据结构中的哈弗曼树。哈夫曼树的构造，、树的带权路径长度-Hafu Man in the tree data structure. Huffman tree structure, tree path length weighted
xishujvzhen
- 数据结构中的经典算法，稀疏矩矩阵在程序中常使用二维阵列表示，二维阵列的大小与使用的存储器空间成正比，如果多数的元素没有数据，则会造成存储器空间的浪费，-Classical algorithm in the data structure, sparse moment matrix two-dimensional array are often used in the program, said the size of two-dimensional array with the use of me
zhebanchazhao
- 数据结构里的经典查找方法，折半查找，减少了查找速度-Find data structure in the classical method of binary search to reduce the search speed
myChess
- 算法分析与设计，期盼覆盖问题的vc++代码，这是自己纠正的。-Algorithm analysis and design, looking forward to covering the vc++ code, which is their corrected.
tuopu
- 实现拓扑排序的功能。使用C语言编译参考严蔚敏版。-Realize the function of topological sort. Using the C compiler reference YAN Wei-min version.
tree
- 二叉树遍历的非递归算法实现。使用C语言编译参考严蔚敏版-Non-recursive binary tree traversal algorithm. Using the C compiler reference YAN Wei-min version
Jose
- 实现约瑟夫环的程序。采用C语言编译。是数据结构的题目。参考严蔚敏-Joseph ring to achieve the program. Using C language compiler. Is the subject of the data structure. Reference YAN Wei-min
Internalsort
- 实现数据结构的内部排序比较，从而分析各种排序的优缺点。-Order to achieve the internal data structure compared to analyze the advantages and disadvantages of various sort.
exercise1
- ICARNEGIE系列教程SSD5数据结构与算法exercise1答案，欢迎广大程序员下载-ICARNEGIE series of tutorials SSD5 data structures and algorithms exercise1 answers, programmers are welcome to download
recommendedexercise1
- ICARNEGIE系列教程SSD5数据结构与算法recommended exercise1答案，欢迎广大程序员下载-ICARNEGIE series of tutorials SSD5 data structures and algorithms recommended exercise1 answer, programmers are welcome to download
exercise1
- icarnegie系列教程SSD5数据结构与算法EXERCISE1满分答案，欢迎广大程序员下载-icarnegie series of tutorials SSD5 data structures and algorithms EXERCISE1 out the answer, programmers are welcome to download
yuesefu--wanggong
- 设编号为1,2, … ,n(n>0)的n个人顺时针方向一圈,每人持有一个正整数密码,开始时,任意给出一个报数上限值，从第一个人开始顺时针方向自1起顺序报数,报到m时停止报数,报m的人出列,将他的密码作新的m值,从他顺时针方向上的下一个人重新自1起顺序报数 如此下去,直到所有人全部出列为止.要求设计一个程序模拟此过程，并给出出列人的序列。-Let numbered 1,2, ..., n (n> 0) of n individuals clockwise circle, each ho