data algorithm, Xiao Ming books

从数组中 任取一个元素 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)

最新收集得老外写的一个矩阵类，功能相当的强大，比以前的源码水平提高了不少，源码中有相当详细的英文注释，简单明了！-collected in the latest foreigner to write a matrix of type, quite powerful, the source than the level a lot, a significant source of detailed notes in English, simple!

这是我们实习时编的，实现了基本的功能，如插入，删除，查找等。初学 C++的同志们可以参考：）-This is our attachments series to achieve the basic functions, such as inserting, deleting, and searching. Novice C comrades can reference :)

应用背景在较复杂的数据处理过程中，通常需要保存多个临时产生的数据，如果先产生的数据先进行处理，那么需要用队列来保存这些数据。关键技术看病，采用先到先看的原则，由于人数的不确定性，这里采用一个带节点的单链表作为队列的存储结构。

这是程序是老师提供的源程序，其中包含了方程的离散等解法 值得一学习。-This is the program source code is provided by teachers, including the discrete equations method, etc. It is worth learning.

设计一个O(n2)时间的算法，找出由n个数组成的序列的最长单调递增子序列。-design an O (n2) time algorithm to identify by the number n of the longest sequence monotonically increasing sequences.

8皇后问题的递归求解，c语言实现-8 Queen of recursive solution, c Language

xmail 邮件程序案例-mail procedures DCS case

有关于二差树的遍历，对于初学者有很大的帮助，-Worse on the second tree traversal, for beginners there are a lot of help,

一个通讯录――――――利用C++实现的，非常不错哦-Address Book- C++ implementation