Binary search works by what process and what is the prerequisite?

• A. It repeatedly halves a sorted array by comparing the target to the middle element; prerequisite: the data must be sorted.
• B. It scans elements sequentially from start to end until the target is found.
• C. It uses a hash function to map targets to indices.
• D. It requires an unsorted array and duplicates to work.

Answer: (A)