CS3510 L11 Chain Matrix Multiplication
Channel: Abrahim Ladha
Date: 2024-02-27

I forgot to mention the runtime at the end. You are filling in n^2/2 elements of a table. As s increases, the lengths of the diagonal decreases but the number of things you are taking a min of increases. The sum ends up remaining the same, so the total time is O(n^3)