Daniel Lemire personal blog
Fast midpoint between two integers without overflow
Let us say that I ask you to find the number I am thinking about between -1000 and 1000, by repeatedly guessing a number. With each guess, I tell you whether your guess is correct, smaller or larger than my number. A binary search algorithm tries to find a value in an interval by repeating … Continue reading Fast…
- Points
- 230
- HN comments
- 214
- Submissions
- 1
- Cited by
- 0 commenters
Software EngineeringMath & Algorithms2022
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Dec 7, 2022 | Fast midpoint between two integers without overflow by ibobev | 230 | 214 |
