Which of the following is a characteristic of a binary search algorithm?

A$)$ It works on unsorted data

B$)$ It requires sorted data

C$)$ It has a linear time complexity

D$)$ It can be used on any data type