You halve the remaining length each time there is a match and only exit the loop...

		badtension on Aug 11, 2023 \| parent \| context \| favorite \| on: Fastest branchless binary search You halve the remaining length each time there is a match and only exit the loop when length is 0 so it should be the first one.