Cache efficiency for linear reads CAN greatly outpace a large array where both the sorting method and the binary search itself might cause a high number of cache misses.