Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Use perfect hashing, instead of binary search, for keyword lookup. Parent comment
Binary search with heap order is cache friendly and much faster. And can speed up with SIMD. Like Intel’s FAST algorithm.
There are no comments on this comment yet.
Binary search with heap order is cache friendly and much faster. And can speed up with SIMD. Like Intel’s FAST algorithm.