Back
All Modules Data Structures & Algorithms Sorting & Searching

Sorting & Searching

Comparison and linear-time sorts, library sorts, binary search, and selection.

0 / 12 solved

  1. Comparison Sorts & The n log n Bound

    Merge sort, quicksort, heapsort, and insertion sort compared, the n log n lower bound, and introsort.

    0 / 4 solved

  2. Counting, Radix & Bucket Sort

    Counting sort and its stability, LSD radix sort, bucket sort, and the space they cost.

    0 / 3 solved

  3. Sort Keys, Stability & Library Sorts

    Timsort, introsort, comparator contracts, stability, and sorting by tuple keys.

    0 / 2 solved

  4. Binary Search & Boundary Conditions

    Loop invariants, half-open vs closed intervals, lower_bound and upper_bound, and off-by-one proofs.

    0 / 1 solved

  5. Quickselect & Order Statistics

    Quickselect, median of medians, heaps for top-K, and streaming selection.

    0 / 2 solved

Up next

12 of 12 questions here are still unsolved.

Next track Hashing