Skip to main content

Matrix Chain Multiplication

Learn Matrix Chain Multiplication (Dynamic Programming, Advanced DSA) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

Finding the Cheapest Order to Multiply a Chain of Matrices Matrix multiplication is associative but NOT commutative in cost - the number of scalar multiplications needed depends heavily on the PARENTHESIZATION order. dp[i][j] = minimum cost to multiply matrices i through j, trying every possible SPLIT point k as the "last" multiplication.

More lessons in Dynamic Programming