the binary tree traversal. And recursive and non

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

课程设计 课程设计 课程设计 课程设计 课程设计-CurriculumCurriculumCurriculumCurriculumCurriculumCurriculumCurriculumCurriculumCurriculum

个人通讯录信息管理系统 -personal address book information management systems for personal address book information management system

Java和Sql Server2005做的 学生学籍管理系统，Java + SQL Server2005 + MyEclipse6.0，作为计算机学院的课程设计已通过老师审核，Word文档，UML建模，代码，数据库文件一应俱全。

数据结构中的一个试验程序，实现简单的校园导游图功能，提供查找最短路径功能。-data structure of a test procedures, a simple guide campus map function, providing the shortest path search function.

用VC编写基于ADO的数据库程序-VC prepared based on ADO database program

算法与数据结构技术!想学C语言数据结构的看看有一定的帮助-algorithm and data structure technology! Like the C language data structures to see if there is some help

(1)利用普里姆算法求网的最小生成树 (2)实现教科书中定义的抽象数据类型mfset。以此表示构造生成树过 程中的连通分量。 (3)以文本形式输出生成树中各条边以及他们的权值-(1) the use of prim algorithm for minimum spanning tree network (2) the realization of the textbook definition of abstract data types mfset. Spanning tree structure to express the process of component connectivity. (3) to text output of all spanning tree edges and their weights

这是本人精心搜集的关于常用图论算法的一套源码，代码内附注释，可供需要的朋友作为参考-carefully collected on the graph algorithm commonly used in a set of source code, code contains Notes the need for a friend as a reference

最小生成树的prim算法 是求图中的最短路径的一个重要算法 但是是O(n2)复杂度的一个算法-minimum spanning tree algorithm is the prim map for the shortest path algorithm of an important but is O (n2) of a complex algorithm