Answer:
A. A binary search can only be used on an ordered group of data values.
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 Computer programming, performing a binary search on an array requires that the array should be sorted in an ascending order i.e from the least to the highest with respect to the data value.
Hence, the true statement is that a binary search can only be used on an ordered (sorted) group of data values.