I recently know about Strassen's aproach in multiplying matrices, which i find very clever and interesting. So i decided to share it. Hope this help :))).

People usually use the naive n^3 method to multiply a n*x and y*n matrix. Which mean the maximum size of n is about 500. But Strassen find a way to do so in n^log2(7) which is about n^2.8, which mean it will bring the maximum size of n to about 750. First, we divide the matrix in to smaller matrix.

Let consider a 2*2 matrix.

The result of this matrix will be:

And if A,B,C,D,E,F,G,H are all matrices of size n*n, it is still remain correct.

So we will multiply these matrices by using divide and conquer, divide them into smaller pieces and conquer them. Each time we multiply two matrices, we divide them into 2*2 matrices and calculate them.

Let consider a 2*2 matrix, regularly we need 8 multiplications to multiply 2 2*2 matrix.

But Strassen find a way to do so in just 7 multiplications so it will reduce the complexity from n^log2(8)(which is n^3) to n^log2(7).

So now i will describe the way he multiply 2*2 matrices with 7 multiplications.