When is a binary search best applied?
Binary search is a type of algorithm. It is best applied to search in a list in which the elements are already in order or sorted.
The binary search algorithm starts searching the list from the middle. If the middle value is not the correct one, then it will go on to search the top or the bottom half in a similar manner, i.e. it will then divide the top or the bottom part into halves and start searching from its middle. It will continue to do this until the searched for value is found.