ASP+ACCESS 的东西，请看下。我很想下载点东西。谢谢了。

unix上的ODBC实现-unix on ODBC to achieve

选课管理数据库,以SQL为实际的数据平台，灵活建立数据库、数据库表、实现对表的各种查询等。-Course management database to SQL data for the actual platform, the establishment of a flexible database table to table to achieve the various inquiries.

主分量变换，不要密码。-PCA transform, not passwords.

实现heap排序的算法，首先把Heap建立起来，然后通过对Heap的根节点来找出当前最小的节点，依次就可以实现排序了。-achieve heap sorting algorithm to first establish Run, then Run right through the current nodes to identify the smallest nodes can be followed to achieve the ranking.

CShap代码 冒泡排序，选择排序，插入排序，希尔排序 算法-Code CShap Bubble Sort, Selection Sort, Insertion Sort, Hill sorting algorithm

文件与IO存取,数据绑定,数据库更新,章立民的程序-Documents and IO access, data binding, database updates, rules and procedures for public

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.

双向链表的各种操作（包括建立，插入，删除，查找等）-Two-way linked list of a variety of operations (including create, insert, delete, search, etc.)

数据结构中最经常用到的，包括链表、双链表、二叉树、平衡二叉树、哈希表等-Data structure the most frequently used, including the list, double linked lists, binary tree, balanced binary tree, hash table, etc.

数据库通用适配器：实现行粒度的数据库的转换-DataBased adaptor