Problem 55355. Chain multiplication - 05
In problem 55315, you had to calculate the number of multiplications required based on the positions of parenthesis.
This problem is a combination of the previous two. You have to place the parenthesis in the proper places so that minimum number of multiplications are required.
For instance, array= [1,2,3,2].
So there are three matrices A, B, and C.
you can multiply in two ways - A(BC) or (AB)C.
A(BC) - requires total 16 multiplications, while (AB)C requires total 12 multiplications. So the later one is the answer.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers2
Suggested Problems
-
Construct a string from letters and counts
141 Solvers
-
205 Solvers
-
43 Solvers
-
12 Solvers
-
Monty Python and the Holy Grail: Crossing the Bridge of Death
30 Solvers
More from this Author165
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!