The binary search algorithm cannot be used to search an array that is not sorted does twice as much work as sequential search on the average case must be written using recursion is slower than sequential search when the item being searched for is not in the array

Option A => cannot be used to search an array that is not sorted

Explanation:

The reason for choosing ‘option a’ is that, the actual working mechanism of binary search is to sort the array first then choose a middle element and compare the given search element with the help of middle element. Let us deeply understand how this sorting and choosing middle element does the work of search.

So this middle element is the key pointer which tells the system that the matching element might be present either to the list of values which are less than middle element or it would be present in the right side / greater than middle element. So, it would search only in the list satisfying the middle element. So it is always necessary to sort the element.