Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update README.md

Browse Source 
Update average case of quicksort: n log n #607
This commit is contained in:
Hector S 2018-10-27 21:30:33 -03:00 committed by GitHub
parent 2deeb8bd85
commit a9502c276e
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

@ -58,7 +58,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]