News for hackers. Stuff that matters.
Re:Binary search is a pathological case for caches by Robin_Message on Monday July 30, 2012 @07:01AM (#4311783)
Ahem. It depends on the workload.

If you regularly search for the same stuff with binary search in a large array, at some size limit your set-associative caches will run out due to aliasing. At that point your data is then never in the cache, even though you could only be accessing 30 or 40 different words of memory.

There are no comments on this comment yet.