• Post Reply
  • Bookmark Topic Watch Topic
  • New Topic

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

 
Leonidas Savvides
Ranch Hand
Posts: 403
  • 0
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
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.



 
Rob Spoor
Sheriff
Pie
Posts: 20372
44
Chrome Eclipse IDE Java Windows
  • 0
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Leonidas Savvides wrote:I tried run this double recurrences unsuccessfully, can you help run it?

ItDoesntWorkIsUseless. So what do you expect, and what does it do instead? Remember, not everybody has that book, so you'll need to tell us.
 
Leonidas Savvides
Ranch Hand
Posts: 403
  • 0
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
solved by

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])))
 
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic