Quicksort: Difference between revisions
Jump to navigation
Jump to search
| Line 11: | Line 11: | ||
| [[Algorithm_Complexity#Worst-case_Running_Time|Worst-case time]] || Θ(n<sup>2</sup>) | | [[Algorithm_Complexity#Worst-case_Running_Time|Worst-case time]] || Θ(n<sup>2</sup>) | ||
|- | |- | ||
| [[Algorithm_Complexity#Average-case_Running_Time|Average-case time]] || | | [[Algorithm_Complexity#Average-case_Running_Time|Average-case time]] || Θ(n lgn) <font color=darkgray>expected</font> | ||
|- | |- | ||
| [[Algorithm_Complexity#Best-case_Running_Time|Best-case time]] || | | [[Algorithm_Complexity#Best-case_Running_Time|Best-case time]] || | ||
Revision as of 00:35, 10 August 2018
Internal
Overview
In-place sorting algorithm.
| Worst-case time | Θ(n2) |
| Average-case time | Θ(n lgn) expected |
| Best-case time |