严蔚敏编写的《数据结构》第3章的答案，全部为源码

书中共介绍了四类排序函数：插入排序、起泡排序、选择排序、快速排序。我们需要建立一个无序随机序列，分别用上述排序方法对建立的无序序列有序化，编写相应的程序计算每种算法的赋值次数、比较次数以及所用时间，以此为依据来判断各种算法的效率。-introduced a total of four ranking functions : insertion sort, bubble sort, select, in order of Quick Sort. We need to build a disorderly random sequence, the use of such methods of sequencing to establish an orderly sequence of the disorder, and the preparation of the corresponding procedures of each algorithm for the calculation of frequency assignment, as well as comparison with the number of time, using this as the basis to judge the efficiency of algorithms.

计算圆周率 Pi (π)值, 精确到小数点后 10000 位 只需要 30 多句代码！-Pi calculated pi () values, accurate to 10,000 decimal places only need more than 30 sentence code!

The crystallize of the initial study, one class examination system of calculator, everyone gives order to point out.-The crystallize of the initial study, one class examination system of calculator. everyone gives order to point out.

用vc6.0写的全面管理库存的数据库程序-Vc6.0 write with the overall management of inventory database program

Kruskal算法寻找最小生成树,C语言实现，有完整的注释！-Kruskal finding minimum spanning tree algorithm, C Language, a complete Notes!

数据结构经典：《用C++描述数据结构》 作者：埃利斯・霍罗维茨 1997-Data Structure classic:

本程序详细 演示了 vc如何连接数据库，对学习mysql与vc++ 有很大帮助-This procedure demonstrated in detail how to connect vc database mysql and studying vc++ has a lot to help

图论中二分图匹配求最佳匹配的KM算法，用c实现，简单易懂-Graph Theory in the bipartite graph matching the best match for KM algorithm, with c realize, easy-to-read

数据结构课程设计-curriculum design data structures!

问题描述：设有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.