Which of the following is true about a binary search algorithm?

A$)$ It can be applied to any list.

B$)$ It has a time complexity of O$($n$).$

C$)$ It requires the list to be sorted.

D$)$ It searches for an element sequentially.