Algorithmica company blog

Eytzinger Binary Search

This tutorial is loosely based on a 46-page paper by Paul-Virak Khuong and Pat Morin “Array layouts for comparison-based searching” and describes one particular way of performing efficient binary search by rearranging elements of a sorted array in a cache-friendly way.
Points
118
HN comments
16
Submissions
1
Cited by
9 commenters

Math & AlgorithmsSoftware Engineering2023

On Hacker News

SubmittedTitle on HNPointsComments
Apr 28, 2023Eytzinger Binary Search by mikecarlton11816

Cited in comments

Linked from 11 Hacker News comments by 9 different people, from Jul 2020 to May 2026.

Most recent:

Search every comment that links here →

Related posts from the same era