4.1-3 Suppose that instead of partitioning matrices by index calculation in MATRIX- MULTIPLY-RECURSIVE, you copy the...

Transcribed Image Text:

4.1-3 Suppose that instead of partitioning matrices by index calculation in MATRIX- MULTIPLY-RECURSIVE, you copy the appropriate elements of A, B, and C into separate n/2 x n/2 submatrices A11, A12, A21, A22; B11, B12, B21, B22; and C11, C12, C21, C22, respectively. After the recursive calls, you copy the results from C11, C12, C21, and C22 back into the appropriate places in C. How does recurrence (4.9) change, and what is its solution? 4.1-3 Suppose that instead of partitioning matrices by index calculation in MATRIX- MULTIPLY-RECURSIVE, you copy the appropriate elements of A, B, and C into separate n/2 x n/2 submatrices A11, A12, A21, A22; B11, B12, B21, B22; and C11, C12, C21, C22, respectively. After the recursive calls, you copy the results from C11, C12, C21, and C22 back into the appropriate places in C. How does recurrence (4.9) change, and what is its solution?

Answer rating: 100% (QA)

In the MATRIXMULTIPLYRECURSIVE algorithm described in the question if you partition matrices A B and ... View the full answer