updated mistake in README.md

manojsrivatsavsfu · web-flow · commit 686145355ea0 · 2017-12-01T11:30:19.000+05:30
merge sort runs average case at O(n logn) not O(n^2)
diff --git a/README.md b/README.md
@@ -59,7 +59,7 @@ From [Wikipedia][quick-wiki]: Quicksort (sometimes called partition-exchange sor
 __Properties__
 * Worst case performance	O(n^2)
 * Best case performance	O(n log n) or O(n) with three-way partition
-* Average case performance	O(n^2)
+* Average case performance	O(n log n)
 
 ###### View the algorithm in [action][quick-toptal]
 
