Indeed: A branch taken 50% of the time can be readily predicted 100% of the time...

		twoodfin on Aug 11, 2023 \| parent \| context \| favorite \| on: Fastest branchless binary search Indeed: A branch taken 50% of the time can be readily predicted 100% of the time if it follows a pattern the CPU can infer. Why you have to be careful choosing realistic input data if you are microbenchmarking at this level for a real purpose.