本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。...

具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.

求K阶斐波那契序列 一个难得的数据结构示例 有详细注解 适合正在学习数据结构的STU-For K-order Fibonacci sequence a rare example of data structure has detailed annotations are learning the data structure suitable for the STU

描述图的头文件，不过是用C描述的，移植到了VC当中-description of the plan is the first document, but is described in the C and transplant them to the VC

易经起名卦例的存取,用户可以方便存取原名和改后的名字信息-database development,use vc++ and mfc software develop,give all source,user can get and store his name and change name conveniently

数据结构最小生成树-minimum spanning tree data structure

sybase数据库同步备份1采用了tcp通信。 2实现自由选择主辅库。

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;

一个用来检查数据重复性的存储过程-one used to check the repeatability of data storage process

数据结构：有关树所有操作- Construction of data: The related tree all operates

用JSP链接到数据库使用起来非常简单，CUT然后PASTE，原代码中我给出了详细的注释。-Using JSP link to the database is very simple to use, then PASTE CUT, the original code I presented a detailed notes.