I just stumbled over this one independently while researching this topic some more, it's an interesting read, thanks for sharing. > For readers only interested

I just stumbled over this one independently while researching this topic some more, it's an interesting read, thanks for sharing. > For readers only interested in an executive summary, our results are the following: For arrays small enough to be kept in L2 cache, the branch-free binary search code is the fastest algorithm. For larger arrays, the Eytzinger layout, combined with the branch-free prefetching search algorithm is the fastest general-purpose layout/search algorithm combination.