Arithmetic Coding

这个源代码是在线购物车。他们只有一个用户可以选择产品并提交未经注册的信息。

学生成绩信息管理系统的源代码及运算结果和分析-Student performance information management system" s source code and the calculation results and analysis

二叉排序树的建立和删除，详见内附文档-two forks of trees and the establishment of deleted files containing detailed

程序存储问题:设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是Li ，1≤i≤n 程序存储问题要求确定这n 个程序在磁带上的一个存储方案，使得能够在磁带上存储尽可能多的程序。 编程任务： 对于给定的n个程序存放在磁带上的长度，编程计算磁带上最多可以存储的程序数。 数据输入：由文件input.txt给出输入数据。第一行是正整数n，表示文件个数。接下来的1 行中，有n 个正整数，表示程序存放在磁带上的长度。 结果输出: input.txt output.txt 6 50 5 2 3 13 8 80 20 -program storage problem : There n procedures (1,2, ..., n) to be stored in the length of the L tape. I kept in the proceedings on the tape length is Li, 1 i n storage procedures to seek to establish that n procedures on tape storage of a program that allows the tape to store as much as possible the procedure. Programming tasks : to the n procedures stored in the tape length, calculated programming on tape can store up to the number of procedures. Data input : from the document input.txt given input data. The first line is a positive integer n, said the document number. Following a visit, n is an integer, said procedures stored on tape length. Results output : input.txt output.txt 6 50 5 2 3 13 8 80 20

图的DFS遍历，以及两种拓扑排序的实现，一种是DFS拓扑排序，另一种是无后继结点的拓扑排序-map DFS traversal, and the two topological sorting the realization DFS is a topological sorting, Another is no subsequent node of topological sorting

直接通过ADO操作Access数据库-directly through ADO Access database operation

用于对计算机等级考试所需的数据库的查询和存储-used for computer examination of the necessary inquiries and database storage

这是一个可以检索大量数据的程序，希望对需要的朋友有所帮助 -This is a large volume of data retrieval procedures, and I hope to have a friend in need of help

c语言编写，利用六种方法进行排序运算，以此对比各种排序方法的特点，包含源程序和课程设计报告。-c language using the six methods of sorting operations, thus comparing the characteristics of a variety of sorting methods, including source code and curriculum design report.

可用代码生L成SQL Server用户表的表结构定义，包含字段/类型，可选择是否打印索引/约束/注释等