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 lifthrasiir on Monday July 20, 2020 @03:02AM (#23895368)
> That is because you no longer need to compute a mid-point at every iteration, those are now pre-computed in the ordered array.

This is called the Eytzinger layout [1].

[1] https://arxiv.org/abs/1509.05053

[ Parent | on HN ]
Re:Binary Search: A new implementation that is up to 25% faster by peter_d_sherman on Monday July 20, 2020 @03:08AM (#23895413)
Did not know that!

Interesting!

Upvoted!

[ Parent | on HN ]