mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-20 08:12:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #247 from antfitch/antfitch-patch-2

Browse Source 
Updated average case for Quicksort
This commit is contained in:
Harshil 2018-02-01 07:28:56 +05:30 committed by GitHub
commit 1da1e2016c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -55,7 +55,7 @@ From [Wikipedia][quick-wiki]: Quicksort (sometimes called partition-exchange sor
__Properties__ __Properties__
* Worst case performance O(n^2) * Worst case performance O(n^2)
* Best case performance O(n log n) or O(n) with three-way partition * 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] ###### View the algorithm in [action][quick-toptal]