In order to do a binary search on an array Group of answer choices you must first do a sequential search to be sure the element you are looking for is there. the array must first be sorted. the values of the array must be numeric. All of these are true

the array must first be sorted.

Explanation:

Binary search is an efficient algorithm used to find an item from a sorted list of items by using the run-time complexity of Ο (log n), where n is total number of elements.

Binary search applies the principles of divide and conquer.

In order to do a binary search on an array, the array must first be sorted in an ascending order.