小型图书馆管理系统！

Generating next numbers in SQLServer should not be a problem. But problems arise when a customer asks for different types of next numbers that you cannot generate directly from SQL Server. This brief article describes how you would tackle this problem in different scenarios.

可以在打印之前并在程序内直接设置所有的参数!-in print before the procedure and direct all the parameters set!

这个程序是使用jdbc-odbc访问access数据库的实例-use of this procedure is jdbc- odbc visit examples of database access

这是俺编写的一个堆栈，采用模版函数编写，面向过程设计，供大家参考-I prepared a stack, using templates prepared function, process-oriented design, for your reference

假设某银行有4个窗口对外接待客户,从早晨银行开门起不断有客户进入银行。由于每个窗口在某个时刻只能接待一个客户，因此在客户人数众多时需要在每个窗口前顺次排队，对于刚进入银行的客户，如果某个窗口的业务员正空闲，则可上前输业务；反之，若4个窗口均有客户所占，他便会排在人数最少的队伍后面。

一个关于数据结构哈夫曼编/译码的程序-Another Huffman tree coding Algorithm for Data Structure.

这是经典迷宫问题，本代码是用C语言实现的-This is the classic maze problem, the code is achieved using C language

清华大学数据结构习题集答案-QingHua university answer to data structure excise

车厢调度----数据结构课程设计。利用的栈的结构进行设计，主要包括栈的基本操作，及进行调度的算法。-Scheduling data structure inside the curriculum design. Use the structure of the stack design, including the basic operation of the stack, and scheduling algorithms.

在一台机器上只能处理n个作业，每个作业均可在单位时间内完成，又假定每个作业都有一个截止期限，当且仅当作业i在它的截止期限之前完成时，可以获得一定的效益。 给定作业序列，要求一种作业排序算法，使获得的总效益值最大。 -On a single machine can handle only n-jobs, each job can be completed within the unit, but also assumes that each job has a deadline, if and only if job i in its completed before the deadline, they can to receive some benefits. For a given job sequence, requires a job sorting algorithm, so that the greatest value of total benefits received.