7. What is the (a) Best case (b) Worst case running time of this algorithm, justify your answer. ALGORITHM Matrix Multip

[answerhappygod]

7 What Is The A Best Case B Worst Case Running Time Of This Algorithm Justify Your Answer Algorithm Matrix Multip 1 (218.81 KiB) Viewed 22 times

7. What is the (a) Best case (b) Worst case running time of this algorithm, justify your answer. ALGORITHM Matrix Multiplication(A[0..n — 1, 0..n – 1], B[0..n — 1, 0..n − 1]) //Multiplies two n-by-n matrices by the definition-based algorithm //Input: Two n-by-n matrices A and B //Output: Matrix C = AB for i 0 ton - 1 do ← for j←0 ton - 1 do C[i, j] < 0.0 ← for k0 to n 1 do return C C[i, j]C[i, j] + A[i, k] * B[k, j]