rotate

• STRATEGY DIVIDE-AND-CONQUER
• STRATEGY GREEDY
• STRATEGY DYNAMIC PROGRAMMING
  • Matrix Sequence Multiplication
  • Divide and Conquer Solution
  • Recursive Formulation of M[i,j]
  • Recursive Formula and Time Taken
  • Matrix Parenthesization Order
  • Work out
• DYNAMIC PROGRAMMING REQUIREMENTS
  • Observation 1: Optimal Substructure
  • Observation 2: Overlapping Subproblems
  • Memoize
  • Dynamic Programming Implimentation
• About this document ...