Back to curriculum
Course section
Searching
Locate values efficiently with sequential scans, divide-and-conquer, and binary-search boundary patterns.
3 topics01
Linear Search
Linear search checks elements one at a time and works on unsorted data with no preprocessing.
ComplexityC++ implementation Worked trace Visual lab
02
Binary Search
Binary search repeatedly halves an ordered search interval, reducing lookup from linear to logarithmic time.
ComplexityC++ implementation Worked trace Visual lab
03
Binary Search Patterns
Lower bound, upper bound, answer-space search, and rotated-array search extend binary search beyond exact lookup.
ComplexityC++ implementation Visual lab