Question

When performing matrix multiplication (C = A \times

  • B in a code flow, if matrix A is m \times n and matrix B is n \times p, what is the time complexity of the standard algorithm?
A O(m + n + p)
B O(m \times p)
C O(m \times n \times p)
D O(log(m \times n \times p))
E O(n²)
Practice Next

Hey! Ask a query