The binary search algorithm assumes that the items in the array are _____ and it either finds the item or eliminates half of the array with one comparison.
a) Sorted in ascending order
b) Randomly arranged
c) Sorted in descending order
d) Distributed uniformly