资源列表
sort
- 输入10个数 排序并计时然后再搜索并计时-it can sort 10numbers
example
- 建立一棵二叉排序树并输出该树的结构，然后让用户输入下列操作符：i(插入),s(查找),d(删除),p(输出结构),q(退出程序)，程序执行相应操作。-Create a binary sort tree and outputs the structure of the tree, and then let the user enter the following operators: i (insert), s (find), d (delete), p (output structure), q
calculate01
- 假设集合Ａ和Ｂ的元素都是整数，并利用两个线性表la和lb分别存放集合Ａ和Ｂ的成员。现依次取出lb中的每个元素，按其值查找线性表la，若la中不存在该元素，则将它插入到la中去，最后线性表la就存放了集合ＡＵＢ的元素。-Assume a collection of elements of A and B are integers, and two linear tables la and lb, respectively, to store the sets A and B members. No
treenode
- 画出一棵二叉树，写出按照initial()函数建立该二叉树的字符序列。编写一个程序能建立一棵二叉树，并求所有叶子及结点总数。-Draw a binary tree, write in accordance with the initial () function to establish the sequence of characters of the binary tree. Write a program to establish a binary tree, and ask all th
Dijkstra
- 根据Dijkstra算法写出程序计算从顶点到其它各顶点的最短路径和最短距离。-Calculation of the vertices of the shortest path and shortest distance from the vertex to the Dijkstra algorithm to write programs.
Floyed
- 根据Floyed算法写出程序计算对顶点间的最短路径和最短距离。-According to the Floyed algorithm to write program to calculate the shortest path and shortest distance between vertices.
chuanjiaoshi
- 有3个传教士和3个野人要过河，只有一艘船，这艘船每次只能载2个人过河，且无论哪边野人的数量大于传教士的数量时，野人就会吃掉传教士。怎样让他们都安全过河？-Three missionaries and three wild man to cross the river, only one ship, the ship can only set two individuals across the river, and regardless of which side of Savage s num
paixufangfa
- 选择，插入，冒泡三种排序方法。 选择，插入，冒泡三种排序方法。 -Select, insert, bubbling three sorting methods. Select, insert, bubbling three sorting methods. Select, insert, bubbling three sorting methods.
algorithms
- 附件是邓建明老师上的算法课的详细课件，设计算法设计与分析的各个方面，如分治法，贪心算法，平摊分析等，希望对大家有帮助-Attachment algorithm Jian-ming teacher lesson courseware, and all aspects of the design algorithm design and analysis, such as divide and conquer method, greedy algorithms, amortized analysis
kmp
- 用于识别子串 模式匹配算法 KMP算法 输入两个String-Used to identify substring pattern matching algorithm KMP algorithm to enter two String
Maze
- A 星算法，用来在游戏或者路劲规避中寻找最短路径！-A star algorithm, find the shortest path is used to circumvent the game or Road King!
depth-first
- 可以实现树的深度优先遍历，编译通过，可以即时使用。-It Can achieve a depth-first traversal of the tree, compile, and can immediately use