资源列表
01beibao
- 01 背包 自己编写的一个小算法 希望够帮助大家-Back pack
main
- 已知用左右链表示的二叉树，要求编写算法求任意在二叉树中任意两点P、Q的最近公共祖先。-Known that the binary tree with a chain around, requiring the preparation of any algorithm for any two points in the binary tree in P, Q of the last common ancestor
main
- 二叉树的建立、遍历 实现递归、非递归的遍历，前序、中序和后序都要求实现-The establishment of a binary tree, traversal recursion, non-recursive traversal, preorder, inorder and postorder are required to achieve
5090729032_Project2
- 数据结构的作业,希望对大家有帮助，是AVL树-It is my homework
Kruskal
- 克鲁斯卡尔算法，实现最小生成树，并且可以通过参数控制连通分支的数量-Kruskal algorithm for minimum spanning tree and connected components can be controlled by the number of parameters
MergeSort
- 归并（Merge）排序法是将两个（或两个以上）有序表合并成一个新的有序表，即把待排序序列分为若干个子序列，每个子序列是有序的。然后再把有序子序列合并为整体有序序列-Merge (Merge) sort is two (or more) into a new sorted list ordered table, that is to be sorted sequence is divided into several sub-sequences, each sequence is ordered.
package
- 有N件物品和一个容量为V的背包。第i件物品的重量是c[i]，价值是w[i]。求解将哪些物品装入背包可使这些物品的重量总和不超过背包容量，且价值总和最大-There are N items and a capacity of V backpack. The weight of the i-th item is c [i], the value of w [i]. Which solution will allow these items into the backpack does not exc
Waterman
- 水人算法，也就是有名的waterman算法，运用回溯法来计算一个二维矩阵的最优路径-Water were algorithm, which is well-known waterman algorithm, using backtracking to calculate the optimal path to a two-dimensional matrix
The-optimal-route-inquires-bus
- C开发，利用Floyd算法找出按时间的所有两站之间的最优路径，按时间最优的路线选择，按价格最优的路线选择-C,Floyd，Find out optimal path，by time, by price
shujujiegou
- 数据结构教学资料。含教案，习题，习题答案，以及各章节PPT-Data structure teaching and learning materials. Including lesson plans, exercises, exercise answers, and the chapters PPT
2010211307-1-24
- 分别写出下列函数的递归算法和迭代算法，并求出n=10时的函数值。 Fib(n)= n 当n=0或n=1 Fib(n-2)+Fib(n-1) 当n 2 假设以带头结点的循环链表表示队列，并且只设一个指针指向队尾元素结点而不设头指针，试编写相应的队列初始化、入队列、出队列和判断队列状态的算法。 利用上述算法完成下面的各操作，并在每一操作后输出队列状态。 1)下列元素逐一入队：5,7,3,8,55 状态：5个元素 2)3个元素出队 状态：２个
fwf
- miler_rabin 算法实现,验证是否是素数，（概率性测试）-Miler_rabin algorithm, validation is a prime, (probabilistic tests)