Re:Static search trees: 40x faster than binary search (2024)
by Tostino on Saturday July 18, 2026 @08:22AM
(#48957484)
It's a combination of both. Your data layout could be very cachable for one algorithm, but very much not so for another algorithm.
[ Parent
| on HN ]
There are no comments on this comment yet.