# Keyword Analysis & Research: binary search algorithm in data structure

## Frequently Asked Questions

What is the objective of binary searching?

Binary search is a more specialized algorithm than sequential search as it takes advantage of data that has been sorted. The underlying idea of binary search is to divide the sorted data into two halves and to examine the data at the point of the split.

What is the algorithm for binary search?

Binary search algorithm. In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array. One may also ask, where is binary search used?

What is the process of binary search?

Binary search is the process of finding a value in a list of values with O(log n). Binary search is used with a list of sorted elements only. In the binary search algorithm, every pair of elements are compared, if they are not in required order then both are swapped otherwise next pair is compared.