Sorting algorithms: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 27: | Line 27: | ||
|O(n log n) | |O(n log n) | ||
|O(n) / O(1) with linked list | |O(n) / O(1) with linked list | ||
|- | |||
|Radix sort | |||
| | |||
| | |||
|O(kn) | |||
| | |||
|} | |} | ||
== Resources == | == Resources == | ||
Revision as of 07:06, 3 October 2020
Definition
Stable sort: two elements with equal keys are in the same order after sorting. For instance, insertion sort, merge sort, bubble sort are stable. Quicksort, heapsort are unstable.
Complexity
| Sorting algoritm | Worst-case performance | Best-case performance | Average performance | Worst-case space complexity |
|---|---|---|---|---|
| Bubblesort | O(n2) | O(n) | O(n2) | O(1) |
| Mergesort | O(n log n) | O(n log n) | O(n log n) | O(n) / O(1) with linked list |
| Quicksort | O(n2) | O(n log n) | O(n log n) | O(n) / O(1) with linked list |
| Radix sort | O(kn) |