Quicksort

Partition around a pivot, fix its position, then sort both remaining ranges.

Remember: Partition first; recurse around pivot.

Example: [3,1,2], pivot 2 → [1,2,3].

Time: O(n²) worst; O(n log n) average. Auxiliary space: O(n) worst stack.

Formula: Partition around the last value; recursively sort both remaining ranges

Up to 15 integers. Lomuto partition, fixed last-element pivot, unstable. Sorted/all-equal inputs can cause quadratic time and linear recursion depth; average assumes random input order.

Complexities describe the underlying algorithm; tutorial snapshots and rendering can use additional resources.

The interactive workspace loads here when JavaScript is available. You can still browse the learning notes and links above without it.