资源列表
KnapsackProblem
- 用动态规划的方法求解0/1背包问题，vc编写。-Using dynamic programming method for solving 0/1 knapsack problem, vc preparation.
KnapSack1
- knapsack problem to get maximum profit
0_1beibao
- 0——1背包的算法，使用数组存储，内含测试数组-0- 1 knapsack algorithm, using an array of storage, an array containing the test
NON
- 实现二叉树三种遍历（先序遍历、中序遍历、后序遍历）的非递归算法。-The realization of the three binary tree traversal(PreOrderTraverse,In OrderTraverse,PostOrderTraversal)of the non-recursive algorithm.
main
- acm regional kaohsiung 2006 Perfect Service poj 3398
stack
- 顺序栈的基本操作，有初始化，插入和删除元素等-The basic operation of the order of the stack
3SAT
- 3sat验证程序，算法验证，计算机算法设计与分析课程-3sat verification process, algorithm verification, program design and analysis of computer algorithms
00123
- 非递归实现二叉树的后序遍历程序，希望随大家有帮助-The recursive realize binary tree after the order sequence, the hope of times with help
kuohaopipei
- 数据结构括号匹配程序， -Parenthesis matching program
Bign
- big-number类，解决大数运算，无除法。-big-number arithmetic class to solve large numbers, no division.
xlbd
- 这是一个序列比对算法，两个序列，字符相同得两分，与空格匹配得一分，错配得0分，计算最高得分与匹配情况-This is a sequence alignment algorithm, two sequences of characters the same two points, and the match was a sub-space mismatch 0 points, the highest score of the match situation computing
lab2
- 0-1背包问题：若有物品n个，每个物品的价值Value，用vi表示，每个物品的重量weight用wi表示，其中vi和wi均为非负数。设背包的总容量为W，且W为非负数。本程序可选择装入背包的物品，并使装入背包的物品总价值最大。-Value, with vi, said the weight of each item s weight by wi, where vi and wi are non-negative. The total capacity of the backpack set W,