Strassen's Matrix Multiplication

Breaking the $O(n^3)$ barrier with 7 clever recursive multiplications.

Recursive Multiplication Execution

Step 1 / 10

Matrix A

1	2
0	3

Matrix B

4	2
-4	-3

→

Computing...

Current Step Explanation

Starting with two 2x2 matrices.

Strassen Logic

Pseudocode

1function strassen(A, B):
2  if n == 1: return A*B
3  partition A,B into 4 submatrices
4  compute 7 products P1..P7
5  combine into result matrix C
6  return C

Quick Tip

Strassen's algorithm is only efficient for very large matrices. For smaller ones, the overhead of extra additions and memory allocation for submatrices makes it slower than the standard $O(n^3)$ triple-loop.

Closest Pair of Points Fast Fourier Transform (FFT)