This preview shows page 1. Sign up to view the full content.
Unformatted text preview: M 1 × M 2 × ... × M n , it should be grouped as ( M 1 × M 2 × ...M k ) × ( M k +1 × ... × M n ), where M k has minimum number of columns. 4. Modify the algorithm given in the class to show how the order of matrix multiplication can be obtained along with the optimal number of multiplications needed. 5. Give a dynamic programming algorithm to compute a n given the following formula: a = 1 a n = a n/ 2 * a n/ 2 if n is even. a n +1 = a n/ 2 * a n/ 2 * a if n is odd. 1...
View Full
Document
 Fall '10
 sanjay
 Algorithms, C Programming

Click to edit the document details