What must be true about the data structure for binary search to work?

What must be true about the data structure for binary search to work?

Step 1: Understand that binary search is a method used to find an item in a list.
Step 2: Know that for binary search to work, the list must be sorted in a specific order (either ascending or descending).
Step 3: Realize that sorting the list allows the algorithm to compare the target item with the middle item of the list.
Step 4: If the target item is less than the middle item, the search continues in the left half of the list.
Step 5: If the target item is greater than the middle item, the search continues in the right half of the list.
Step 6: This process of eliminating half of the remaining items continues until the target item is found or the search space is empty.

No concepts available.