Sorting Algorithm Performance Characteristics

Algorithm Name Best Case Worst Case Average Space Complexity Documentation
Bitonic Merge O(log2(n)) O(log2(n)) O(log2(n)) O(n log2(n)) Reference Link
Bubble O(n2) O(n2) O(n2) O(n) Reference Link
Comb O(n) O(n2) O(n2) O(1) Reference Link
Heap O(n log n) O(n log n) O(n log n) O(n) Reference Link
Insertion O(n) O(n2) O(n2) O(n) Reference Link
Merge O(n log n) O(n log n) O(n log n) O(n) Reference Link
Odd Even O(n) O(n2) O(1) Reference Link
Quick O(n log n) O(n2) O(n log n) O(n) Reference Link
Selection O(n2) O(n2) O(n2) O(1) Reference Link
Shell O(n log n) O(n2) O(n) Reference Link