Re:Beautiful branchless binary search
by utopcell on Friday April 28, 2023 @08:53AM
(#35740690)
Eytzinger layouts are great, but they require more space if one is not allowed to touch the original sorted array. Then again, if you are allowed to use extra space, lower_bound operations (aka binary searching) can be implemented in worst-case constant time for integer arrays.
[ Parent
| on HN ]
There are no comments on this comment yet.