Comparison-Based

← Back to Sorting

Sorting algorithms that determine element order by comparing pairs of elements. Comparison-based sorts have a theoretical lower bound of O(n log n) in the worst case.

Key Properties

• Bubble Sort
• Selection Sort
• Insertion Sort
• Merge Sort
• Quick Sort
• Heap Sort

Related

• Non-Comparison (alternative approach)
• Analysis (evaluating sorting performance)

---

algorithms sorting comparison-based