Bubble Sort
Time: O(n²) • Space: O(1)
Simple but slow. Repeatedly swaps adjacent elements.
Quick Sort
Time: O(n log n) • Space: O(log n)
Divide and conquer. Fast in practice.
Merge Sort
Time: O(n log n) • Space: O(n)
Stable sort. Consistent performance.