Merge pull request #30 from nandanabhishek/master

Updated README.md

Author: ramanaditya

algorithms/Sorting/README.md

@@ -4,9 +4,9 @@
 | :---: | :--- | :---: | :---: | :---: | :---: | :---: |
 | 1. | Bubble Sort | O(n^2) | O(n^2) | O(n) | O(1) | Stable |
 | 2. | Selection Sort | O(n^2) | O(n^2) | O(n^2) | O(1) | Unstable |
-| 3. | Insertion Sort | O(n^2) | O(n^2) | O(n^2) | O(1) | Stable |
+| 3. | Insertion Sort | O(n^2) | O(n^2) | O(n) | O(1) | Stable |
 | 3. | Merge Sort | O(n log(n) ) | O(n log(n) ) | O(n log(n) ) | O(n) | Stable |
-| 4. | Quick Sort | O(n log(n) ) | O(n log(n) ) | O(n^2 ) ) | O( log(n) ) | Unstable |
+| 4. | Quick Sort | O(n^2 ) ) | O(n log(n) ) | O(n log(n) ) | O( log(n) ) | Unstable |
 
 > **Stable** : Relative position of equal elements after sorting remains same.
 >