Given that most binary searches have an overflow error built in, I think it’s harder than a first year problem to do binary searches without the classical overflow error…