Description: 0-1背包问题的动态规划算法C语言实现.Windows系统下 Wintc环境编写-0-1 knapsack problem of the dynamic programming algorithm C language. Windows systems Wintc Central Habitat prepared Platform: |
Size: 1024 |
Author:xieyixin |
Hits:
Description: 这是关于01背包问题的动态规划算法。采用C++语言完成的,代码间有注释。-This is about 01 knapsack problem dynamic programming algorithm. Using C++ language completed, there are comments between the code. Platform: |
Size: 1024 |
Author:zhenhong |
Hits:
Description: 原创,背包问题的四种解法,回溯法,动态规划法,以及两种蛮力法,C++代码,编译运行通过,结果正确,可以比较各种方法的效率。-The original, four solutions of the knapsack problem, backtracking, dynamic programming, and two brute force method, C++ code, compile, run through, the result is correct, you can compare the efficiency of the method. Platform: |
Size: 2451456 |
Author:ZLS |
Hits:
Description: 0/1背包问题动态规划详解及C代码
动态规划是用空间换时间的一种方法的抽象。(0/1 knapsack problem dynamic programming detailed and C code
Dynamic programming is the abstraction of a method of replacing time with space.) Platform: |
Size: 13312 |
Author:zhangruliang
|
Hits: