order stack the basic operation, a total of nine, and Xiulan WU Weimin textbooks...

经典收藏c源程序-classic collections c source

从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用. 算法平均时间复杂度: O(nlogn) -Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)

立春葆的数据结构李春葆：数据结构习题与解析（C语言版）.pdf-Li-Chun Li Chun-bao-bao of the data structure: Data structure and analysis of exercise (C language version). Pdf

用C做的括号匹配程序,可以检测用户输入的括号是否匹配并给出提示-C matching brackets do procedures, the user can input the brackets and whether the match is suggested

比较简陋的数据库应用,唯一能看的就是对ODBC的封装-Comparison of simple database application, is the only way to look at the package of ODBC ...

算法设计与分析的习题及题解，希望大家能喜欢。-Algorithm design and analysis solution exercises and questions, I hope everybody can like.

堆排序:思想: 用二叉树的结构来表示数组,及用数组来表示二叉树的结构,比如i为父节点其孩子为,2i,和2i+1.其中,大顶堆中 父节点大于其两个孩子 算法平均时间复杂度: O(nlogn) -HEAPSORT: thinking: using binary tree structure to express the array, and used to express an array of binary tree structure, such as i the parent node for its children, 2i, and 2i+ 1. Among them, the big top of a pile of the parent node greater than two children on average time complexity of algorithm: O (nlogn)

数据结构实验，内部排序的源码及实验报告！-Experimental data structure, the internal ranking of the report source and experimental!

网吧的基本操作都可以，包括刷卡，上下机等-Internet cafes can be basic operation, including credit card, from top to bottom, etc.

the embedded light weight database with source