2 votes 2 votes The Matrix Chain-Product dynamic programming Algorithm runs in _______ linear time exponential time quadratic time cubic time Algorithms go-alogrithms-1 algorithms dynamic-programming time-complexity + – Bikram asked Oct 4, 2016 Bikram 329 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes its: Time Complexity: O(n^3) Auxiliary Space: O(n^2) http://www.geeksforgeeks.org/dynamic-programming-set-8-matrix-chain-multiplication/ cse23 answered Oct 15, 2016 selected Oct 15, 2016 by Arjun cse23 comment Share Follow See all 0 reply Please log in or register to add a comment.