College Entrance Examination Management Information System

实现各种内部排序。包括冒泡排序，直接插入排序，Shell排序，快速排序，堆排序，并比较排序的比较次数和移动次数。主要是C语言。-achieve internal order. Including bubble sort, direct insertion sort, Shell sort, quick sort, heap sort, and compare the ranking of number and mobile number. C is the main language.

多种排序方法的c实现和查找。入门看看还可以-various methods of sorting and searching c achieve. Portal can also see

基数排序：思想:先从数据的低位开始,进行分配,分成10个空间,分别存储位为,0,1,2,3...9 重复的对次地位操作,知道预定的高位,排序完成-Radix Sort: thinking: from data low starting distribution, divided into 10 space, storage spaces, respectively, for 0,1,2,3 ... repeated 9 times the status of the operation, to know the scheduled high ranking completed

1．定义哈希表数据结构。 2．除留余数法做为哈希函数、 H(key) = key P 用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。 3．编写函数，求查找成功时的平均查找长度（ASL）。-1. Define hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing with linear probing methods of conflict resolution, write a function to achieve the hash table making process and output of the hash table. 3. Write function, seeking to find success, the average search length (ASL).

常用算法和数据结构的c++实现方法！-commonly used algorithms and data structures of c method!

ｃ＃语言快速入门基础代码带注释，主要是针对那些对C#想快速入门的人并且有一定的C++基础的人提供的，快如懂得C#的基本语句和面向对象的基本思想。

对Oracle OCI的封装- To Oracle OCI seal

SQL Server、Oracle、Sybase、ODBC的JDBC驱动文件，全部测试过-SQL Server, Oracle, Sybase, and ODBC JDBC driver, all tested

Its about data structure Tr-Its about data structure Tree

在学习数据结构时，往往不知道那些结构与算法有何用，以及怎么用。这个小小程序充分显示了Huffman二叉树的应用。虽然其压缩效果比RAR相差甚远，但也能说明一二。 -the study data structure, they often do not know what the structure and algorithm, as well as how use. This little procedure fully demonstrated the application of the binary tree Huffman. Although the compression ratio falls far short of RAR, but can also explain on January 2.