I tried run this double recurrences unsuccessfully, can you help run it?
ch15.2 - Dynamic Programming - Matrix multiplication Parenthesize in Introduction to Algorithms,
* Second edition, by Thomas H. Cormen, Charles E. Leiserson, Ronald
* L. Rivest, and Clifford Stein.

given matrices A1A2A3A4A5A6 with dim series 5,10,3,12,5,50,6 , find propel parenthesize pattern for min scalar multiplications....but do not do the multiplication...

result:

((A[1]A[2])((A[3]A[4])(A[5]A[6])))

I’ve looked at a lot of different solutions, and in my humble opinion Aspose is the way to go. Here’s the link: http://aspose.com

subject: I tried run this double recurrences unsuccessfully, can you help run it