Binary Search Algorithm, Definition, Code
A Binary Search Algorithm is an efficient algorithm for finding an item from a sorted list of items. The algorithm works by repeatedly dividing the list into half portions, which can contain the item to be searched until we narrow down the possible location to just one.