The number of comparisons made by a binary search is expressed in powers of two is a "true" statement.
What is binary search?
Binary search is a quick search algorithm with an O run-time complexity (log n).This search algorithm operates on the divide and conquer principle.
Some key features regrading the binary search are-
- A collection of data should be sorted for such a algorithm to function properly.
- Binary search makes it look for a specific item by trying to compare the collection's middlemost item.
- If a match is found, the item's index is returned.
- If the object is greater than that of the middle item, the item is looked up with in sub-array to a left of the middle element.
- Alternatively, the item is sought in the sub-array to a right of the center item.
- This process is repeated on the sub-array till a size of the sub-array is reduced to zero.
to know more about the binary search, here
https://brainly.com/question/15402776
#SPJ4
