控件datagridSource

自底向上排序：思想: 将数组的个部分,两两有序数组进行合并 算法平均时间复杂度: O(nlogn) -Bottom-up sequencing: thinking: The array of parts 22 in an orderly array merge algorithm for the average time complexity: O (nlogn)

哈希表设计是数据结构中重要的一个项目，该程序详尽说明了哈希表的建立等过程。-hash wishes it is an important project in the structure of the data that the form is designed, this procedure proves exhaustivly hash wishes such course as the setting-up of the form ,etc..

一个三层应用程序，演示如何通过ADO对象以及存储在SQL Server中的Procedure实现高性能的数据访问(在运行程序前首先要设置SQL Server，在压缩包中有一个Procs.sql的文件，首先在SQL Server上运行该文件设置SQL Server数据库)-a three-tier applications, demonstrating how ADO and SQL Server stored in the Procedure to achieve high-performance data access (in the first before running the program to set up SQL Server, in a compressed Procs.sql a document, the first in SQL Server running on the document set up SQL Server database)

利用简单优先法输出逆波兰式 将中缀式转化成逆波兰式-priority method using simple inverse Polish exports of Chinese-grade into reverse Polish

供销信息查询系统-Marketing Information System

这个程序是按照离散数学教材上给出的算法写的，是字典序的全排列算法。空间复杂度是O(n)，时间复杂度基本上是O(n^2)。缺点是只用于打印并没有储存所有的结果。-the procedure is in accordance with the materials on discrete mathematics algorithm is written, is a wholly-lexicographic order algorithm. Space complexity is O (n), is basically time complexity is O (n ^ 2). Only drawback is not for print, and store all the results.

线性表元素删除运算,删除线性表L中第i个位置上的元素-linear elements to delete Table Operational delete Table L linear section i positions on the elements

数据结构1800例题与答案 我想对大学生很有用啊-data structure with 1,800 examples, I would like to answer students useful ah

对给定书的总页码，计算出书的全部页码中分别用到多少次数字0，1，2，3...9.-DataStatistics

资源描述C++写的购票系统，可以实现查询车次信息，购票，退票等功能，车次信息是提前预定好的，可以自己修改，考虑到了多个站点以及发车时间问题，解决了购票冲突问题，即在不同车站买到同一个座位上的车票。