Binary Search: Search a sorted array by repeatedly dividing the search interval in half. //Begin with an interval covering the whole array. //If the value of the search key is less than the item in ...

Array = {3, 5, 6, 9, 78}, target number = 6 . Index of number 6 in the given array = 2. Write Binary search to find the number in given array as discuss in the class.