Randomized Sort
Randomized quicksort: random pivots to avoid adversarial inputs and worst-case splits
Sitemap
- 📜 Posts
- 👨💻 About me
- 🏫 My Princeton homepage
Recent posts
Quick Sort
Quicksort partitioning intuition, loop invariants, and best/average/worst-case analysis
Heap Sort
Heap sort explained with max-heapify intuition, CLRS notes, and sample implementations
Merge Sort
Merge sort via divide-and-conquer, with sentinels, recursion tree analysis, and code
Insertion Sort
Iterative + recursive insertion sort, with complexity notes and Python/Scala examples