Please enable JavaScript to use CodeHS

APCSP20: AAP-2.P.1

CodeHS Lessons

The binary search algorithm starts at the middle of a sorted data set of numbers and eliminates half of the data in each iteration until the desired value is found or all elements have been eliminated. EXCLUSION STATEMENT (EK: AAP-2.P.1): Specific implementations of the binary search are outside the scope of the course and the AP Exam.

Standard
7.6 Finding an Element in a List
Standard
7.3 For Loops and Lists
Standard
7.6 Finding an Element in a List
Standard
7.6 Finding an Element in a List
Standard
6.6 Finding an Element in a List
Standard
6.6 Finding an Element in a List
Standard
4.6 Finding an Element in a List
Standard
5.3 For Loops and Lists