The Matrix Chain-Product dynamic programming Algorithm runs in _______
its:
Time Complexity: O(n^3) Auxiliary Space: O(n^2)
http://www.geeksforgeeks.org/dynamic-programming-set-8-matrix-chain-multiplication/
64.3k questions
77.9k answers
244k comments
80.0k users