Describe the term binary search

Question

Describe in brief the term binary search?

Answer 1

Binary search is a method of locating an element in the sorted list. The search begins by dividing the list to two parts. The algorithm compares the median value. When the search element is less than the median value, then the top list will only be searched, after finding out the middle element of that list. The procedure continues till the element is found or the search in the top list is done. The similar process is continued for the bottom list, till the element is found or the search in the bottom list is done. If an element is found, then that should be the median value.