Binary Search

Works for a sorted sequence of anything. Idea is to reduce the search space repeatedly until we reach to the final element or search space becomes exhausted. // Iterative Approach int left = 0 ,right = n -1; while(left<=right) int mid = (left + right...