矩阵连乘问题(递归+动态规划+备忘录法)

矩阵连乘问题的介绍网上很多，就不复述了，以下分别用递归算法、动态规划算法和备忘录法实现．

---

• 递归算法实现

/******************** Divide-Conquer ********************/
int MatrixChain_Recursive(int i, int j, int *size, int **s)
{
    if (i == j)
        return 0;
    int result = INT_MAX;
    int tmp;
    for (int k = i; k < j; k++)
    {
        tmp = MatrixChain_Recursive(i, k, size, s) + MatrixChain_Recursive(k + 1, j, size, s) + size[i - 1] * size[k] * size[j];
        if (tmp < result)
        {
            result = tmp;
            s[i][j] = k;
        }
    }
    return result;
}

• 动态规划算法实现

/******************** Dynamic Programming ********************/
void MatrixChain_Dynamic(int n, int *size, int **m, int **s)
{
    for (int i = 1; i <= n; i++)
        m[i][i] = 0;             // l = 1
    for (int l = 2; l <= n; l++) // l is the chain length, 自底向上！
    {
        int j;
        for (int i = 1; i <= n + 1 - l; i++)
        {
            j = l + i - 1;
            m[i][j] = m[i][i] + m[i + 1][j] + size[i - 1] * size[i] * size[j]; // k = i
            s[i][j] = i;                                                       // k =