Strassen added

Author: Saurabhdimri06

README.md

@@ -25,3 +25,6 @@ Greedy algorithm is a step based algorithm. In a greedy algorithm we analyze the
  - [Bubble and Selection Sort](https://github.com/Saurabhdimri06/Algorithms-implementation-using-C/tree/master/Bubble%20and%20selection%20sort) Bubble and Selection both are sorting techniques. As we know in our daily lives how much  important it is to have an efficent sorting technique to handel large amount of data so it becomes necessary to have a efficent  sorting technique at hand.
 
 Time Complexity of Bubble Sort - O(n) and that of Selection Sort is -	O(n2)
+
+ - Matrix Multiplication
+ Strassen in 1969 which gives an overview that how we can find the multiplication of two 2*2 dimension matrix by the brute-force algorithm. But by using divide and conquer technique the overall complexity for multiplication two matrices is reduced. This happens by decreasing the total number if multiplication performed at the expenses of a slight increase in the number of addition.