Try this exercise. Click the correct answer from the options.
Which searching algorithm has a time complexity of O(log n) and requires the data to be sorted?
Click the option that best answers the question.
- Linear Search
- Binary Search
- Hashing
- Depth-First Search