Added Comments

Author: ShivangiBhatnagar-246

Arrays/Strassen's_Algo.c

@@ -3,7 +3,7 @@ int main(){
   int mat1[2][2], mat2[2][2], mat3[2][2], i, j;
   int a, b, c, d , e, f, g;
 
-  printf("Enter the elements of first matrix:\n"); //matrix 1
+  printf("Enter the elements of first matrix:\n"); //Input elements for matrix 1
   for(i = 0;i < 2; i++)
   {
       for(j = 0;j < 2; j++)
@@ -12,7 +12,7 @@ int main(){
       }
   }
 
-  printf("Enter the elements of second matrix:\n"); //matrix 2
+  printf("Enter the elements of second matrix:\n"); // Input elements for matrix 2
   for(i = 0; i < 2; i++)
   {
       for(j = 0;j < 2; j++)
@@ -40,15 +40,22 @@ int main(){
       }
       printf("\n");
   }
- //reduced eight times Time Complexity to Seven Times
-  a= (mat1[0][0] + mat1[1][1]) * (mat2[0][0] + mat2[1][1]); 
+
+ //reduced eight times Time Complexity  to Seven Times i.e T(N) = 7T(N/2) +  O(N^2)
+ 
+ // Compexity: before O(n^3) when used Standard Matrix Multiplication , now :O(n^2.808) when used Strassen's Algorithm
+ 
+ //Now we can calculate the product of mat1[i][j] and mat2[i][j] with the following formulas:
+  a= (mat1[0][0] + mat1[1][1]) * (mat2[0][0] + mat2[1][1]);  
   b= (mat1[1][0] + mat1[1][1]) * mat2[0][0];
   c= mat1[0][0] * (mat2[0][1] - mat2[1][1]);
   d= mat1[1][1] * (mat2[1][0] - mat2[0][0]);
   e= (mat1[0][0] + mat1[0][1]) * mat2[1][1];
   f= (mat1[1][0] - mat1[0][0]) * (mat2[0][0]+mat2[0][1]);
   g= (mat1[0][1] - mat1[1][1]) * (mat2[1][0]+mat2[1][1]);
+ //Now with a,b,c,d,e,f,g which are the submatrices of size N/2*N/2
 
+ //Calculate the elements of matrix 3, The resultant matrix mat3[i][j]
   mat3[0][0] = a + d- e + g;
   mat3[0][1] = c + e;
   mat3[1][0] = b + d;