Which of the following is true about binary search. A. It uses binary numbers in its algorithm B. It is slower than sequential search C. It can be implemented using a recursive algorithm D. It does works for both sorted and unsorted arrays. E. None of the above.

A. It uses binary numbers in its algorithm

Explanation:

A Binary search is a type of algorithm designed to look through only a sorted array of data for a particular item.

It is more efficient (faster) than sequential search since the algorithm doesn't have to look up the entire array of data, but simply repeatedly divide in half the section of the array that could contain the searched item.

answerthe above statement is (true);