Implement both a standard (Thetaleft(n^{3}ight)) matrix multiplication algorithm and Strassen's matrix multiplication algorithm. Using empirical testing, try

Question:

Implement both a standard $\Theta\left(n^{3}ight)$ matrix multiplication algorithm and Strassen's matrix multiplication algorithm. Using empirical testing, try to estimate the constant factors for the runtime equations of the two algorithms. How big must $n$ be before Strassen's algorithm becomes more efficient than the standard algorithm?

Fantastic news! We've Found the answer you've been seeking!