Dynamic Programming

Matrix Chain Multiplication

Finds the cheapest way to parenthesize a matrix product chain.

Matrix trace unavailable.
speed
1.00x
timeline1 / 72

Variables

0 tracked

Variables appear as the algorithm updates them.

Call stack

0 frames

Recursive algorithms push frames here.

Event log

0 entries

Narrated algorithm events appear here.