SQLite包下载和使用SQLite的完整描述，并附有胜创…

很好用的Access工具-good use of Access Tools

如何分离一个顺序表里的0元素和非0元素？本程序展示了三种高效算法并比较他们之间的性能-How to separate 0 and non-0 element in a squencial list? The program shows three effective algorithm and compare their performances.

用VC写的，用栈解决了数据结构基本的迷宫问题.没有用到MFC类库-VC wrote, with a stack data structure to solve the basic problem of the maze. Do not use MFC

采用stack算法的DFS搜索，有java做的界面，还有适当的注释-using stack DFS search algorithm, so java interface, the appropriate Notes

its about the binary recursion

关于这段代码我没有呼唤你在学生信息系统写使用 MS 访问我还精通 MS Access 数据库的发展，但我我还在学习。此应用程序的密码是： iveymae。该系统还将生成为学校学生的出勤报告。

1、 字符串由随机产生的1~16位的字母组成，然后用插入排序、冒泡排序、堆排序、快速排序、归并排序对字符串进行排序。-1, the string randomly generated by the 1 ~ 16 of the letters, and then use Insertion Sort, Bubble Sort, Heap Sort, Quick sort, merge sort to sort on the string.

高级算法里的排序讲义ppt。sorting- In high-level algorithm arrangement printed lecture ppt. Sorting

货郎担限界算法 c语言-traveling salesman Bound algorithm language c

实现树的创建算法，创建一个至少包含3层，8个结点的二叉树，并对此树实现先中后序的递归遍历算法。输出三种遍历结果。再实现一个叶子结点查找算法，判断一个给定的数值是否在此树中作为叶子结点。-To achieve the creation of the tree algorithm, to create at least a three-layer, 8 nodes of a binary tree, and after this tree in order to achieve the first recursive traversal algorithm. Output the results of three kinds of traversal. And then to achieve a leaf node search algorithm to determine whether a given value in this tree as a leaf node.