From a1c146a624cf88ba1cc5076a1e2272461d28d540 Mon Sep 17 00:00:00 2001 From: Ant Fitch Date: Wed, 31 Jan 2018 10:48:48 -0800 Subject: [PATCH] Updated average case for Quicksort A small edit. Average case for quicksort changed from O(n^2) to O(n log n). Sited: https://en.wikipedia.org/wiki/Quicksort --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 70077e98f..d20244c2a 100644 --- a/README.md +++ b/README.md @@ -55,7 +55,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]