mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-10-06 05:39:30 +00:00
Code Issues Packages Projects Releases Wiki Activity

Updated average case for Quicksort

Browse Source 
A small edit. Average case for quicksort changed from O(n^2) to O(n log n). Sited:
https://en.wikipedia.org/wiki/Quicksort
This commit is contained in:
Ant Fitch 2018-01-31 10:48:48 -08:00 committed by GitHub
parent c4234192fa
commit a1c146a624
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__
* 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]