For detailed steps

CodePudding user response:

O (log (n)), is actually the log (n)/log (2) * O (1), the latter two is constant, the time complexity is O (log (n))