For this algorithm to work properly, the data collection must be in the "sorted" form.Binary search, by virtue of its progressively dividing method, has much lower time complexity of "O(log n)". They are missing the case of tail-recursion optimization. Products. CASE3:If the target element is greater than middle i.e target>A[mid],we discard all the elements in the left search space including mid element.Now our new low would be mid+1 while 'high' remains as it is. CASE2:If target is less than middle i.e target