The worst case time complexity satisfies $T(n)=T\left( \frac{n}{2} \right)+\Theta(1)$ so using [[Master Theorem for Polynomial Work]], $T(n)=\Theta(\log_{2} n)$.