Matrix chain multiplication: Difference between revisions

Content added Content deleted
mNo edit summary
Line 28:
__TOC__
== Python ==
WillWe will solve the task in three steps:
 
1) Enumerate all ways to parenthesize (in a recursive generator), and for each one compute the cost. Then simply look up the minimal cost.