Tag
sorted-arrays
- Jul 24, 2025 Learned Indexes: Fitting a Function Instead of Storing Keys How a model that predicts a key position can replace a B-tree search, what the error bound guarantees, and why the last mile is always a search. algorithms
- Jul 1, 2024 Interpolation Search and What Uniform Key Distribution Buys How probing by estimated position turns logarithmic search into log-log search, the exact arithmetic it needs, and the degenerate inputs that make it linear. algorithms
- Dec 23, 2022 Lower Bound, Upper Bound, and the Invariant That Makes Binary Search Correct Why binary search is best expressed as a loop invariant over a half-open interval, how lower and upper bound answer different questions, and which arithmetic breaks first. algorithms