Revision as of 11:04, 12 April 2018 (view source) Eoraptor (talk \| contribs) mNo edit summary ← Older edit		Revision as of 11:05, 12 April 2018 (view source) Eoraptor (talk \| contribs) mNo edit summary Newer edit →
Line 22: * [1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10] To solve the task, it's possible, but not required, to write a function that enumerates all possible ways to parenthesize the product. This is not optimal because of the many duplicated computations, and this task is a classic ~~example~~application of [[:wp:Dynamic programming\|dynamic programming]]. See also [[:wp:Matrix chain multiplication\|Matrix chain multiplication]] on Wikipedia.

Matrix chain multiplication (view source)