资源列表
1
- 快速算法演示，用于将多个数进行快速排序，效果很好。-fastorder
two_dimension_array
- 摘 要 : 在堆中模拟生成二维数组-a simulator that generates 2-dimension-array in heap space, using operator new/delete.
combinations
- 求解Nn的k组合 用字典排序法求N(n k) c-Solving Nn of k combinations Dictionary-ordering Method and N (n k)
1165
- 在字符串中查找数字的个数，输出数据个数和所有的数据-Numbers in the string to find the number, the output data and all the data on the number of
run
- 一到面试题，题目为：400米的运动场上，甲在乙的前方100米处，甲速度6m/s，乙速度7m/s。甲乙两人每跑到整百米处都要休息5s，问乙何时才能追上甲。-One to face questions, the subject of: 400 meter playground, a B in front of the 100 meters, a speed of 6m/s, B speed 7m/s. B went to the entire two hundred meters of each s
Binary-Search
- Binary search In Data structure
delete-linked-node-special
- 该源码用c语言编写，可以删除指定范围的链表结点，是数据结构中链表删除的一种基本练习程序，自己编写的哦。-The source code in C language, you can delete the specified range of the nodes of the linked list, is a basic exercise program delete list in the data structure, the preparation of their own oh.
Cpp1
- 是一个关于c语言的程序，这个程序是关于2个单调递减的集合的合并-C language program, this program is a merger of two monotone decreasing collection
Jose
- 实现约瑟夫环的程序。采用C语言编译。是数据结构的题目。参考严蔚敏-Joseph ring to achieve the program. Using C language compiler. Is the subject of the data structure. Reference YAN Wei-min
HEAPSORT
- 在计算机内部排序的各种算法中 ,用比较大小的方法进行排序时间耗费的最好特性为 O(nlog2 n) ,最坏情况下还会上升到 O(n2 ) [1] 。要达到其理论下界log2 n1≈ nlog2 n- 1.4 4 n是非常困难的。Hashsort 一种散列排序方法-The best features of the computer' s internal sorting algorithm, the sort of time-consuming method of comparative s
1
- 设有n件工作分配给n个人，将工作i分配给第j个人所需要的费用为Ci。试 设计一个算法，为每一个人都分配1件不同的工作，并使总费用达到最小。-suppose n pieces of work are arranged to n persons, it costs Ci to arrange work i to people j. design a algorithm to make it cost least and to make sure that everyone get one diffe
THE-LENGTH-OF-LINE
- 关于枚举中求绳子长度的算法，希望对学习算法的同志有用-the algorithm about the length of line