The Wikipedia has the standard algorithm and pseudocode that's very close to complete Java. Go for it.
http://en.wikipedia.org/wiki/Matrix_chain_multiplication On Sep 29, 12:31 pm, Rashmi Shrivastava <[email protected]> wrote: > Please help me in this, > > Find an optimal parenthesization of a matrix-chain product whose sequence of > dimension is [5,10,3,12,5,50,6]. > > Thank you in advance!! -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
