数据结构课程设计的一些源代码！

银行家算法分析报告（ c语言）-bankers algorithm analysis report (c language)

数据结构中的顺序表操作。如插入，删除等！-Data structure in the order table operation. Such as insert, delete and so on!

堆排序 稳定的排序 复杂度为N（logN ） 也是一种快速的排序-HEAPSORT stable sort complexity is N (logN) is a fast sorting

用VB6开发商品出租信息管理系统 用VB6开发商品出租信息管理系统-For product development using VB6 lease information management system for product development using VB6 lease information management system

ACM解题报告，必有有用，特别对于初学者，看是否对你有帮助-ACM problem-solving report, there must be useful, especially for beginners to see if there is help for you

Access数据库用户权限的管理程序，Delphi，转载-Access database user rights management procedures, Delphi, reprinted

数据结构（清华版），数据结构课后小作业，选择其中较之重点而写 -Data structure (Tsinghua version), data structure after a small operation, select one of the focus than the written

非常实用的NET的SQL 程序-A very useful NET s SQL progam.

这是一个PB小程序　是实现模糊查询的.这是一个PB的小程序，实现模糊查询的 这是一个PB的小程序，实现模糊查询的-PB This a small program is vague inquiries. This a small program PB, Fuzzy inquiry, which is a PB of small programs to achieve fu zzy inquiry, which is a PB of small programs to achieve fuzzy inquiry, which is the one PB small program for the realization of fuzzy

问题描述：设有11种不问的钱币各若干张，可用这II种钱币产生许多不同的面值。试 设计一个算法，计算给定的某个面值，能有多少种不同的产生方法。例如有1分3张，2分 3张，5分1张，则能组成7分面值的方法有：3个1分+2个2分，1个1分十3个2分，2 个1分+1个5分，1个2分+1个5分共四种。 ^编程任务：对于给定的II种不同钱币，编程计算某个给定面值能有多少种不同的产生 方法。-Problem Description: There should be 11 kinds of coins did not ask the number of beds available this II produced many different kinds of coin denominations. Try to design an algorithm to calculate a nominal value of a given that there can be many different returned. For instance, a sub-3, 2 points 3, 5 min 1, then can be composed of seven sub-par methods are: 3 1 min+2 2 points, a 1 minute 10 3 2 points, 2 1 points+1 5 points, a 2 min+1 5 minutes of four kinds. ^ Programming task: for a given II different coins, the calculation of a given program can have many different denominations is returned.