矩阵连乘算法,实现几个矩阵相乘的最优顺序,并计算出复杂度-matrix continually multiply algorithm, achieving several matrix multiplication, the optimal sequence and calculated complexity
这是关于01背包问题的动态规划算法。采用C++语言完成的,代码间有注释。-This is about 01 knapsack problem dynamic programming algorithm. Using C++ language completed, there are comments between the code.