SHELL排序算法与应用

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

匈牙利算法 解决类似于线性规划中的分配问题,用于各种匹配算法-Hungary is similar to linear programming algorithm to solve the distribution problem, for a variety of matching algorithm

迷宫问题。以一个 m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论 起点就是方阵中的（1，1）终点就是（m-1，n-1） -Maze. With an m* n matrix, said the long labyrinth of 0 and 1, respectively, the maze of paths and obstacles. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no access point is a square matrix of the (1,1) The end is (m-1, n-1)

采用VB6.0实现TIN的另一种构建算法：凸闭包构建TIN算法-TIN using VB6.0 to achieve another building algorithms: convex closure algorithm for building a TIN

符号匹配问题编程-Symbol Matching Program

Dijkstra算法， Dijkstra算法，Dijkstra算法-Dijkstra algorithm

严蔚敏数据结构这本书对于大家来说都是必不可少的一本书，其中的经典算法更是被我们好多人细细研读。这么源代码会帮助我们更好地学习这些算法。

有关路由算法的程序，具体要求见压缩文件内容-Routing algorithm of the procedure, specifically asked to see the contents of compressed files

一个求进制的c++算法,希望能给大家带来帮助!如果大家有更好的,别忘记发给我啊! emil:wyx32893039@163.com-seeking a band of c algorithm, we can bring hope to help! If you have the better, do not forget to me ah! Emil : wyx32893039@163.com

数据结构实验，实现多项式乘法，自由输入两个多项式，计算结果并排序。-Experimental data structure, the realization of polynomial multiplication, free importation of two polynomials, the calculation results and sort.