Because that's a branch that's "always" taken, except for once - which, speed-wi... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		einpoklum on Aug 11, 2023 \| parent \| context \| favorite \| on: Fastest branchless binary search Because that's a branch that's "always" taken, except for once - which, speed-wise, is very close to always taken, i.e. not a branch. The author counts the branching inside the loop, which is often taken and often not taken.

postalrat on Aug 11, 2023 [–]

It's not impossible to remove that branch. Until you do that then this is a reduced branch implementation.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact