How can I find out the time complexity for the brute-force implementation of matrix multiplication for:
- Two square matrices ($n \times n$),
- Two rectangular matrices ($m \times n$) and ($n \times r$)?
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.Sign up to join this community