Question

Describe an algorithm to search as efficiently as possible for an object based on the key to sorted array

Answer 1

Explanation:

Binary search is a more efficient search algorithm which relies on the elements in the list being sorted. We apply the same search process to progressively smaller sub-lists of the original list, starting with the whole list and approximately halving the search area every time.