Describe the time complexity of the binary search algorithm in terms of number of comparisons

used $($ignore the time required to compute m $=$ b$($i $+$ j$)/2$c in each iteration of the loop in the algorithm$)$

as well as showing the worst case complexity.