Write an algorithm whose complexity is O(log n).

From the DESCO Sub-Assistant Engineer (CSE) 2019 – Written (BUET) exam, question 10 of 10.