Re:Beautiful branchless binary search
by vlovich123 on Friday April 28, 2023 @01:05PM
(#35744101)
IIRC it really only works well if you have a rarely mutated structure that's read-heavy. Otherwise every time you try to mutate the array, you have to rebuild the layout & it's typically heavier than just sorting (i.e. you have to sort + regenerate the layout). It's a neat concept for sure.
[ Parent
| on HN ]
There are no comments on this comment yet.