Question
A programmer needs finding an item in sorted random-access data, and the chosen structure has the property that it compares with a middle element at each step. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Binary Search
Explanation:
Binary Search fits because it supports finding an item in sorted random-access data and it compares with a middle element at each step.
Both clues point to this choice.
Leave a Reply