# Time Complexity for matrix multiplication? [duplicate]

How can I find out the time complexity for the brute-force implementation of matrix multiplication for:

1. Two square matrices ($n \times n$),
2. Two rectangular matrices ($m \times n$) and ($n \times r$)?