Computer scienceAlgorithms and Data StructuresAlgorithmsArray algorithmsSearch algorithms

Binary search

Find the truth

Report a typo

Select one correct statement about binary search.

Select one option from the list

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

In some cases when an array contains a billion elements the algorithm can find a specified element using a single comparison.

It divides the array into two subarrays at each step and then searches in both of them.

It can search elements in sorted and unsorted arrays.

___

Create a free account to access the full topic