Time Complexity of Sorting Algorithms

Quick Sort

• Best/Average Case: O(n log n)
• Worst Case: O(n²)
• Use When: General purpose sorting, when average case performance is important

Merge Sort

• All Cases: O(n log n)
• Use When: Stable sort needed, consistent performance required, external sorting

Heap Sort

• All Cases: O(n log n)
• Use When: Memory is limited, guaranteed O(n log n) performance needed

Selection Sort

• All Cases: O(n²)
• Use When: Minimizing number of swaps is important

Insertion Sort

• Best Case: O(n)
• Average/Worst Case: O(n²)
• Use When: Small datasets, nearly sorted data, as subroutine in hybrid algorithms