资源列表
biTree
- 实现二叉排序树查找
Btree
- 实现二叉树基本操作，数据结构中的基本程序-Realize the basic operation of binary tree, data structure, the basic procedures
bfsf.c
- BFS algorithm implemented using c
SHELLPX
- 输入待排数据元素序列，然后用希尔排序法对其进行排序。-input data elements to row sequence, and then use the Hill sorting its ranking.
4
- 有向图的邻接矩阵存储（数组表示）、简单输出
crosschain
- 将两个十字链相加 且依旧存在第一个链表中-Sum of the two cross-chain and still exist in the first list
List
- 顺序表的建立，遍历，查找。程序比较简单，自己做着玩的-The order of table creation, traversal, search
backpack
- 背包问题的简单求解，适合适合刚刚学习c的同学理解数据结构-Knapsack problem simple solution, suitable for students just learning to understand the data structure c
number-interval
- 输入一个整数，将各位数字反转后输出,输入一个0~6的整数，转换成星期输出-Enter an integer, will you digital output after inversion, input a integer 0 to 6, the output into a week
shu
- 增强二叉搜索树是二叉搜索树的一种推广，其中每个结点除了保存关键字外，还保存了以该结点为根的子树的结点数目（包括该结点本身）。实现其建立、复制、前/中/后序遍历、层高统计、结构从属判断等操作。-Enhanced binary search tree is a generalization of a binary search tree, where each node except to save the keyword, but also save the node number points
non0_1-Knapsack-and-full-sorting
- 这是全排序算法和非零一背包问题的简单实现，程序可以正确运行。-This is the simple realization of the whole sorting algorithm and the non0_1 kanpsack problem, the program correctly.
maopao
- 冒泡排序，包含函数处理时间的计算。使用到clock()，请头文件包含time.h；#define h 30000（或其他值）-Bubble sort, including the calculation of the function of processing time.Clock () used, the header file contains from time.h. # define h 30000 (or other values )