Computer scienceAlgorithms and data structuresAlgorithmsArray algorithmsSearch algorithms

Binary search

Some more statements

Report a typo

Select all correct statements about binary search.

Select one or more options from the list

If an input array doesn't contain the specified element, the algorithm performs only a single comparison.

It can search elements in descending sorted arrays.

When the algorithm starts searching in a new subarray, it calculates a new middle element.

It has the time complexity O(sqrt(n)) where n is the size of an input array for searching.

Create a free account to access the full topic