The time complexity for the binary search algorithm in the text is $\_\_\_\_\_\_\_\_.$

Question $9$ options:

O$($n$^2)$

O$($nlogn$)$

O$($logn$)$

O$(2^$n$)$