| Class | Description |
|---|---|
| BubbleSort | |
| CountingSort |
Assumes that each of the n input elements is an integer in the range 0 to k, for some integer k
Time complexity: Θ(n)
|
| InsertionSort | |
| MergeSort | |
| QuickSort |
Time complexity: Worst case is O(n^2), when the array is already sorted, best case is O(nlogn)
|