7. What is the (a) Best case (b) Worst case running time of this algorithm, justify your answer. ALGORITHM MatrixMultipl
Posted: Thu Jul 14, 2022 2:06 pm
7. What is the (a) Best case (b) Worst case running time of this algorithm, justify your answer. ALGORITHM MatrixMultiplication (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 to n−1 do return C