Array Layouts for Comparison-Based Searching
arxiv.org
arxiv.org
The Eytzinger layout and search has got to be the coolest data structure and most elegant algorithm I've learned in a long time. Plus, such a great "by-the-way" dive into all the essential elements of writing high performance code, and how mechanical sympathy trumps complexity analysis, in a single case study that has application to so many computer science problems.