merge sort average&worst case scenarios changed (#340)

AnshulMalik · web-flow · commit 73ae8f2dd9e9 · 2018-09-28T09:45:34.000+05:30
diff --git a/README.md b/README.md
@@ -41,8 +41,8 @@ From [Wikipedia][merge-wiki]: In computer science, merge sort (also commonly spe
 
 __Properties__
 * Worst case performance	O(n log n)
-* Best case performance	O(n)
-* Average case performance	O(n)
+* Best case performance	O(n log n)
+* Average case performance	O(n log n)
 
 
 ###### View the algorithm in [action][merge-toptal]
