A linear search through a small array can be faster than a binary search through a data structure with a lot of pointers that causes page faults or cache misses.

• 如果二进制搜索通过的数据结构具有许多导致页错误或缓存未命中的指针,则通过小数组的线性搜索可以比二进制搜索快。