Data Structures and Algorithms (DSA)

Q9. Which of the following searching algorithms has a time complexity of O(log n)?

Tap an option, see immediate feedback, retry the wrong ones, and review the final correct answers at the end.