Daniel Lemire personal blog
You can beat the binary search
We sometimes have to look for a value in a sorted array. The simplest algorithm consists in just going through the values We sometimes have to look for a value in a sorted array. The simplest algorithm consists in just going through the values one by one, until we encounter the value, or exhaust the … Continue reading…
- Points
- 360
- HN comments
- 166
- Submissions
- 1
- Cited by
- 0 commenters
Math & AlgorithmsSoftware Engineering2026
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Apr 27, 2026 | You can beat the binary search by vok | 360 | 166 |
