Algorithms MCQ - Sorting and Searching
- A A binary search begins with the middle element in the array
- B A binary search continues having the array either until a match is found or until there are no more elements to search
- C If the search argument is greater than the value located in the middle of the binary, the binary search continues in the upper half of the array
- D For a binary search to work, the data in the array must be arranged in either alphabetical or numerical order
