Sorting algorithms differ in time, space and stability.
1Complexities (best / average / worst)
Bubble, insertion: n / n² / n²
Selection: n² / n² / n²
Merge: n log n (all cases), O(n) extra space
Quick: n log n / n log n / n²
Heap: n log n (all cases), in place
Counting: n + k