From 69afe33713f0a6686d2f9621d05030a26876437e Mon Sep 17 00:00:00 2001 From: Archana Kumari <32739028+archanaserver@users.noreply.github.com> Date: Sat, 17 Aug 2019 00:39:06 +0530 Subject: [PATCH] change the stable properties Quick Sort is always unstable because of the relative order of records in the case of an equality of keys. --- book/content/part04/quick-sort.asc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/book/content/part04/quick-sort.asc b/book/content/part04/quick-sort.asc index 0e856679..ad2dfdbb 100644 --- a/book/content/part04/quick-sort.asc +++ b/book/content/part04/quick-sort.asc @@ -77,7 +77,7 @@ With the optimization, Quicksort has an _O(n log n)_ running time. Similar to th ===== Quicksort Properties -- <>: [big]#✅# Yes +- <>: [big]#❌# No - <>: [big]#✅# Yes - <>: [big]#️❌# No, mostly sorted array takes the same time O(n log n). - <>: [big]#️❌# No, the pivot element can be choose at random.