From 9154e0b7b1018d7324b6e9c031ef0f93ad3075e6 Mon Sep 17 00:00:00 2001 From: Saurabh Dimri Date: Thu, 4 Jul 2019 23:08:39 +0530 Subject: [PATCH] matrix complexity added --- README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/README.md b/README.md index bd3bb78..f012487 100644 --- a/README.md +++ b/README.md @@ -28,3 +28,5 @@ 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. + + The general algorithm's time complexity is O(n^3), while the Strassen's algorithm is O(n^2.80).