algorithm Sorting
Parameters
| Parameter | Description |
|---|---|
| Stability | A sorting algorithm is stable if it preserves the relative order of equal elements after sorting. |
| In place | A sorting algorithm is in-place if it sorts using only O(1) auxiliary memory (not counting the array that needs to be sorted). |
| Best case complexity | A sorting algorithm has a best case time complexity of O(T(n)) if its running time is at least T(n) for all possible inputs. |
| Average case complexity | A sorting algorithm has an average case time complexity of O(T(n)) if its running time, averaged over all possible inputs, is T(n). |
| Worst case complexity | A sorting algorithm has a worst case time complexity of O(T(n)) if its running time is at most T(n). |
