​​How does binary search work?
A. Binary search sorts an array by dividing the given list in half, and repeating that process until it finds the target value.
B. Binary search sorts an array by checking every value in the list until it reaches the target value.
C. Binary search sorts an array by comparing a value to the already sored values and shifting it to fit it in where it belongs.
D. Binary search sorts an array by moving items in an unsorted list into a sorted list one at a time and swapping numbers one at a time with elements in the sorted list.
Answer:D
​​How does binary search work?
A. Binary search sorts an array by dividing the given list in half, and repeating that process until it finds the target value. B. Binary search sorts an array by checking every value in the list until it reaches the target value. C. Binary search sorts an array by comparing a value to the already sored values and shifting it to fit it in where it belongs. D. Binary search sorts an array by moving items in an unsorted list into a sorted list one at a time and swapping numbers one at a time with elements in the sorted list.