Re:Binary Search: A new implementation that is up to 25% faster
by klyrs on Monday July 20, 2020 @09:17AM
(#23897492)
Exponentially distributed data is a great example of that. It's fun that the author picks 32-bit ints; I suspect that you just don't have enough dynamic range to really hobble interpolated search.
[ Parent
| on HN ]
There are no comments on this comment yet.