First of all let's understand what is binary search ... 4- Thus every time we search in half the array of the previous array. * 5- Its time complexity is O(log n) which means that its a very efficient ...