Hoare Partition Visualization

How it works: Pick pivot (first element). Pointer i scans right to find element ≥ pivot. Pointer j scans left to find element ≤ pivot. If i < j, swap them. Repeat until pointers cross.

Click "Next Step" to start partitioning.

pivot = 8

i = -1

j = 8

≤ pivot

≥ pivot

📝 Pseudocodefunction hoarePartition(A, lo, hi):
    pivot = A[lo]
    i = lo - 1
    j = hi + 1
    while true:
        do i++ while A[i] < pivot
        do j-- while A[j] > pivot
        if i >= j:
            return j  // partition point
        swap(A[i], A[j])

⚡ Hoare Partition

📝 Pseudocode