方括号做的程序，用户可以输入括号，以及是否可以使用。

本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。-I uploaded is to use greedy algorithm to find small change problem. Greedy algorithm is the fundamental idea is to gradually get the optimal solution.

集束搜索,经典算法，不用过多介绍了吧/。-cluster search, classical algorithm, not too many on the Bar /.

本程序的功能主要是建立并实现了二叉树的算法 -this program is the main function of the establishment and the realization of a binary tree algorithm

Realiza inventarios no terminado

本设计完成了要求的所有功能，可由系统建立一张图或者由用户自行建立一张图,并对该图进行关键路径的搜寻.用户界面友好，有用户使用说明,每一步操作都有说明与提示。程序运行通过，有详细的解释说明。-the design completed all the required functions, from the establishment of a system or plan established by the users themselves a map, and this map critical path of the search. User friendly interface, users note, every step of the operation have notes and hints. Running through a detailed explanation.

数据结构里的dfs算法，包括递归与非递归。用vc6.0编写-data structure, the dfs algorithms, including recursive and non- recursive. Prepared with vc6.0

Dapper-一个简单的.Net对象映射程序

采用链式存储结构设计广义表,实现以下操作:创建广义表,取广义表的表头元素和表尾元素 求广义表的深度-Chain store use of the structural design of the generalized form, realize the following: create a generalized form, check the generalized table header elements and table elements for the end of the depth of the generalized form

可以实现两个大整数（不限数位）相加减！ 在C＋＋中，加减法的两个数必须在系统规定内，本程序突破了这一界限！-can achieve two large integers (Open-digit) is modified! In C++, and subtract the number two must be within the system, the process broke the limits!

A*算法只要求产生问题的全部状态空间的部分结点及关系,就可以求解问题了,搜索效率较高。当然由于A*算法中没有回溯，因此某些情况下可能会找不到正确的解过程。 -A* algorithm only requires a problem all part of the state space and the relationship between nodes, we can solve the problem, the search more efficient. Of course, as a result of A* algorithm is not retroactive, so some cases may be unable to find the correct solution of the process.