Binary search

Searching a sorted collection by repeatedly dividing the search range in half.

Progress

0/3 solved

3 questionsConcept practice0/3 answeredQuestion 1 of 3

Question 1

Which statement is true about binary search?

It can be used on any unsorted list and always runs in constant time.It works by checking each element one by one from start to end.It requires the data to be sorted and repeatedly cuts the search range in half.It always uses more memory than linear search.