All of you alraedy know the binary search..I need not to explain that algorithm...

we know that there are two compariosions one for greater than mid value and other is for less than mid value. Optimize this algorithm/program so that only one comparision shoul happened in that algorithm?

Note: binary search means not a binary serch tree.... BST algorithm is totally different that Binary Serch algorithm.

we know that there are two compariosions one for greater than mid value and other is for less than mid value. Optimize this algorithm/program so that only one comparision shoul happened in that algorithm?

Note: binary search means not a binary serch tree.... BST algorithm is totally different that Binary Serch algorithm.