Pat Morin personal blog
Memory Layouts for Binary Search
Binary search is a wonderful algorithm: theoretically optimal, fast in practice, and discoverable by school children playing guessing games. Usually we think of binary search as being applied to a sorted array, and we teach it this way.
- Points
- 113
- HN comments
- 24
- Submissions
- 1
- Cited by
- 0 commenters
Systems & PerformanceSoftware Engineering2015
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| May 8, 2015 | Memory Layouts for Binary Search by rcfox | 113 | 24 |
