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# | | [[Algorithm_Complexity#Expected_Running_Time|Expected running time]] || Θ(n lgn) | ||
|- | |- | ||
| [[Algorithm_Complexity#Best-case_Running_Time|Best-case time]] || | | [[Algorithm_Complexity#Best-case_Running_Time|Best-case time]] || | ||
Revision as of 00:53, 10 August 2018
Internal
Overview
In-place sorting algorithm.
| Worst-case time | Θ(n2) |
| Expected running time | Θ(n lgn) |
| Best-case time |