Hard Problemsminimizationinterval
Matrix Chain Multiplication
Given the dimensions of a chain of matrices that must be multiplied together in a fixed left-to-right order, find the minimum number of scalar multiplications needed by choosing where to place the parentheses, without reordering the matrices themselves.
Do this lesson first: coin changeThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.