An implementation and application of the algorithm from the IPCO 2023 paper "A Nearly Optimal Randomized Algorithm for Explorable Heap Selection." The algorithm efficiently finds the nth smallest ...

Deterministic Quicksort — uses the last element as the pivot Randomized Quicksort — selects a uniformly random pivot to avoid worst-case behavior The project includes comprehensive benchmarking, unit ...