Which of the following is true for the complexity of a binary search?

$O(1)$

$O(n)$

$O(logn)$

$O(nlogn)$