资源列表
1111111
- ostu 算法源程序C希望对大家有些用 好东西也
shengchengshu
- 8.3.5利用邻接表图的深度优先生成树生成算法-8.3.5 adjacency list graph using depth-first spanning tree generation algorithm
Sequence-table-operation
- 在顺序存储结构实现基本操作：初始化、创建、插入、删除、查找、遍历、逆置、合并运算。-Storage structure in order to achieve basic operations: initialization, create, insert, delete, search, traverse, inverse set, merge operations.
BiTREE
- 输入二叉树的先序序列和中序序列，根据这两个序列，输出二叉树的后序序列,用C语言实现这个程序。-Input sequence and the first sequence of binary tree inorder sequence, based on these two sequences, the output binary sequence after sequence.
Demo
- 数据结构中快速排序的代码实现。快速排序的平均时间复杂度为 log2n,-Data structure in the quick sort code. The average time complexity of the quick sort log2n,
建树和遍历
- 建树和遍历-achievements and Ergodic
number_of_fibs
- 计算满足a<=x<=b且是Fibonacci数的x个数。-Calculated to satisfy a
sy1
- 链表的建立，建立以个链表以及完成插入，删除等操作。-List the establishment of the establishment of a linked list and the completion of insertion, deletion and other operations.
4
- 设无向图G有n个点e条边，编写算法建立G的邻接表，并按照深度优先搜索输出顶点间。-Let undirected graph G with n vertices e edges, G to write algorithms to establish the adjacency table, and depth-first search in accordance with the output vertex requires time complexity of the algorithm is
0-1_package_problem
- 0-1背包问题：使用动态规划算法进行求解0-1背包问题-0-1 Knapsack Problem: Solve the 0-1 knapsack problem using a dynamic programming algorithm
birstday
- 生日是星期几 写一个程序，只要输入生日的年月日，就能回答那天是星期几。
ecpx
- 在二叉排序树上实现对给定值进行查找操作.其中:1)用二叉链表来存储二叉排序树，对于输入的数值大小没有具体要求，即随意输入数据。2）给定一个待查找的值，在二叉排序树上进行查找操作，并输出查找结果。