Step-by-step Solution:

The binary search algorithm works by repeatedly dividing the search range by half. This leads to a logarithmic time complexity, specifically ( O(\log n) ). \[\] Correct Option: (b)