News for hackers. Stuff that matters.

A comment on Binary Search: A new implementation that is up to 25% faster. Parent comment

Re:Binary Search: A new implementation that is up to 25% faster by adrianN on Monday July 20, 2020 @12:20AM (#23894623)
AVL and Red-black trees are pretty terrible and can easily be improved upon by cache-friendlier data structures like for example B-trees.
[ Parent | on HN ]

There are no comments on this comment yet.