Question
Which data structure or concept is best described as a searching algorithm that repeatedly halves a sorted search interval?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Binary Search
Explanation:
Binary Search is a searching algorithm that repeatedly halves a sorted search interval.
This description distinguishes it from the other choices.
Leave a Reply