Sorting Algorithms

1
2
3
4
5

Bubble Sort:  O(n²) — simple, slow
Selection Sort: O(n²) — simple, in-place
Insertion Sort: O(n²) — good for small data
Merge Sort:  O(n log n) — stable, consistent
Quick Sort:  O(n log n) avg — fast in practice

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

# Bubble Sort O(n^2)
def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        for j in range(0, n-i-1):
            if arr[j] > arr[j+1]:
                arr[j], arr[j+1] = arr[j+1], arr[j]
    return arr

# Quick Sort O(n log n)
def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    pivot = arr[len(arr) // 2]
    left = [x for x in arr if x < pivot]
    middle = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]
    return quick_sort(left) + middle + quick_sort(right)

data = [64, 34, 25, 12, 22]
print(f"Bubble: {bubble_sort(data.copy())}")
print(f"Quick: {quick_sort(data.copy())}")