Comment on Static search trees: 40x faster than binary search (2024)parentComments−Tostino1moIt's a combination of both. Your data layout could be very cachable for one algorithm, but very much not so for another algorithm.
Comments
It's a combination of both. Your data layout could be very cachable for one algorithm, but very much not so for another algorithm.