访问数据库，实现教务管理的功能

基数排序：思想:先从数据的低位开始,进行分配,分成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

我写的数据结构小程序是关于排序算法的，功能比较全-I write the data structure of small programs algorithm, the entire comparison function

表达式求值：支持浮点运算，以及一些纠错功能-expression evaluates : support floating-point operations, and some correction function

队列相关的所有基本算法，西电的老师写的，与吴伟民数据结构课本完全一致，用C实现-cohort of all the basic algorithm, the West-- written by the teachers, and textbooks Xiulan WU Weimin data structure is fully consistent with achieving C

c++下的AOV实现-c achieve the AOV

包裹ca.pfv.spmf公司.关联规则.TopKRules;

这是一个TSP问题的限界算法，用C++编程的

一个有趣的算法。。。十分有趣-an interesting algorithm. . . Very interesting

《数据结构》清华大学的，蓝皮（c语言篇）65页 模拟银行业务，计算客户平均逗留时间-"data structure," Tsinghua University, the Blue Paper (c Language) 65 simulation banking, calculate the average length of stay customers

基本数据结构类的定义和实现: MyStack ,MyPoint,MyArc,Graph,MyQueuesMyStack为构造的一个通用的C++模版堆栈类 MyPoint为一个坐标结构MyArc为带权的边类Graph为临街矩阵表示的图MyQueues为按权值顺序存储的边的队列-basic data structure class definition and realization : MyStack, MyPoint, MyArc, Graph, MyQueuesMyStack for a generic structure of the C category MyPoint stack template for a structure MyArc to coordinate with the right side of the street like Graph Matrix plans MyQueues value of the order by the right side of the storage Queue