-
LongestIncreasingSequence
找出数组A中最长的递增序列的长度，使用动态规划算法，复杂度为O(N*N)。(Find the longest increasing sequence)
- 2011-09-05 17:36:27下载
- 积分：1
-
Sort
排序程序,包含快速排序、归并排序、谢尔排序、插入排序。输出了比较次数和移动次数。(It is a sort program, including quick sort, merge sort, shell sort and insert sort.It outputs the compare times and movement times.)
- 2009-05-24 18:53:10下载
- 积分：1
-
Eight-Digital
说明： 八数码 对任意数字序列重新排序 高级散列函数 MFC基础编程(Eight Digital
Reorder the sequence of any number
Senior hash function
MFC based programming)
- 2011-04-11 16:31:59下载
- 积分：1
-
NoGo
计算机博弈大赛不围棋的代码 个人所写，可以用来参考( U8BA1 u7B97 u673A u535A u5F08 u5927 u8D5B u4E0D u56F4 u68CB u7684 u4EE3 u7801 u4E2A u4EBA u6240 u5199 uFF0C u53EF u4EE5 u7528 u6765 u53C2 u8003)
- 2021-04-04 19:39:04下载
- 积分：1
-
cengcipianli
按照一定的输入求出二叉树的层次遍历，输出相应的结果(Calculated in accordance with the input binary tree traversal of the hierarchy, the output of the corresponding results)
- 2012-06-08 21:44:41下载
- 积分：1
-
ysph
约瑟夫环，数据结构算法，挺有意思，看看，看看(ysphdfgfgf)
- 2009-03-14 00:16:15下载
- 积分：1
-
sort
数据结构中数据的排序示例,包括堆排序、快速排序等(Data structure to sort the data sample, including the heap sort, quick sort, etc.)
- 2008-06-14 20:52:24下载
- 积分：1
-
jose
约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1，最后结果+1即为原问题的解。
(Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respectively) sitting around a round table. From the number of people gettin k, number of the m man out of the line he s the next person and a number of gettin number to m the man was out of the line and so the law is repeated until the round table were all out of the column. We numbered 0 ~ n-1, the final result is the original problem solution+1 usually solve these problems.)
- 2015-01-09 17:28:41下载
- 积分：1
-
5100309373_2_9
数据结构习题答案，线性链表的实现与适用，数据结构：思想与实现2-9(Data structure exercises answer, linear linked list implementations with applicable data structure: Ideas and Implementation 2-9)
- 2012-11-23 11:12:48下载
- 积分：1
-
fml
已知二叉树的先序遍历结果，建立二叉树并输出其先序、中序、后序遍历结果(Build a binary tree and print the results of preorder, midorder and postorder traversals based on the known result of preorder traversal)
- 2015-02-15 15:20:26下载
- 积分：1
