Sorting Algorithms Comparison

Sorting is one of the most studied problems in computer science. Different algorithms offer different trade-offs between performance, memory usage, and stability.

Bubble Sort

Bubble sort repeatedly swaps adjacent elements when they are in the wrong order. It has O(n²) complexity and is mainly used for educational purposes.

Merge Sort

Merge sort uses a divide-and-conquer strategy and guarantees O(n log n) performance.

Quick Sort

Quick sort is also divide-and-conquer and extremely fast in practice, although its worst-case complexity is O(n²).