Decision Tree
Decision trees for comparison sorts, and why comparison sorting needs Ω(n log n)
Sitemap
- 📜 Posts
- 👨💻 About me
- 🏫 My Princeton homepage
Recent posts
Counting Sort
Stable counting sort in Θ(n+k), with pseudocode and Scala/Python implementations
Randomized Sort
Randomized quicksort: random pivots to avoid adversarial inputs and worst-case splits
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