zeolib 基 mysql zeolib 连接

拓扑排序，数据结构的作业。-topological sorting, data structure of the operations.

huffman编码-huffman coding

对ACCESS数据库进行读写操作的VC代码-right ACCESS database and write the code VC

STL哈希表的使用范例：包括哈希表的创建、插入、查找、删除、内存分配和释放内存。-STL use examples include : Hash Table creation, insert, search, delete, memory allocation and release memory.

求解一个最短路径问题程序，可以参考一下求一个Dijkstra优化算法！ 谢谢了 目的是求给定两点之间的最短距离 或者改一下我的程序也行 -shortest path to solve a problem of procedure, can seek a reference Dijkstra algorithm optimization! Thank you, the purpose is scheduled for 2:00 to the shortest distance between or change my procedure OK

排序算法Sorting algorithm-Sorting algorithm

小图书馆管理系统，有检索、查看，借书，超期表，还书，赔书等功能，还有按专业统计等，access小程序-small library management system, search, check the library and extended table, book, indemnities, and other functions, there are also professional statistics, the access of small procedures

利用c语言实现学生成绩的管理，主要功能有新生的登记注册、学生信息的修改、学生成绩的登记、学生成绩的修改、学生成绩单的格式打印等功能；本程序富含有背景操作等相关内容！

DELPHI计算机科学系教务管理系统,带论文设计,不错的参考-DELPHI Department of Computer Science, Academic Management System, with paper design, a good reference

[问题描述] 将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N） [输入] 待排序记录个数，各关键字的值。 [输出] 关键字从正负分开，正数在前 [存储结构] 待排序记录顺序存储。 [算法的基本思想] 快速排序算法每次任取一个记录的关键字为标准，将其余记录分为两组将，N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前。 #include using namespace std #define MAXNUM 100//设文件的最长可能长度 void sort(int* keys, const int len)//排序 -[Problem Description] N keyword to the integer sequence the entire record. keyword so that all non-negative Records with the keyword for the negative record, at least require the use of the additional space and time complexity of the algorithm is O (N) [imported] to be sort record number, The value of the keyword. [Output] keyword separate from the pluses and minuses are several former [storage structure] scheduling records to be stored sequence. [Algorithm for the basic idea] quick sort algorithm each time a record for any keyword as a standard, The remaining records will be divided into two groups, N-keyword