Binary search: An algorithm that repeatedly divides a sorted list in half to locate a target value.
How to apply it: Explain why binary search requires a sorted list and is much faster than linear search for large data sets.
Course: AP Computer Science Principles · Unit: Algorithms and Programming
Practice questions about Binary search on AimFive — get rubric-based feedback showing exactly which points you earned.
AP and Advanced Placement are trademarks of College Board. AimFive is not affiliated with or endorsed by College Board.