For binary search algorithms: a. Determine the number of iterations required to find a value in a data set. b. Explain the requirements necessary to complete a binary search.
AAP-2.P.1 The binary search algorithm starts at the middle of a sorted data set of numbers and eliminates half of the data; this process repeats until the desired value is found or all elements have been eliminated.
AAP-2.P.2 Data must be in sorted order to use the binary search algorithm.
AAP-2.P.3 Binary search is often more efficient than sequential/linear search when applied to sorted data.