Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
recently I was asked this question in an interview.
In binary search we have two comparisons one for greater than and other for less than the mid value. Can it be optimized in a way so that we need to check only once ?
Yes, in several ways.
By doing a three-way comparison, which exists in some versions Fortran (see “arithmetic IF”).
By playing tricks with the wording – in x86 (and others) assembly you can use one
cmpbut still use two branches.By using the Deferred Detection of Equality trick.