for i = 1 to dim.length - 1 opt[i,i] = 0 for l = 2 to dim.length for i = 1 to dim.length - l k = i + l - 1 opt[i,k] = ∞ for j = i to k-1 prev = best[i,j] + best[j+1,k] val = dim[i-1]*dim[j]*dim[k] + prev if opt[i,k] > val opt[i,k] = val