Searching: Linear and Binary Search
Searching asks whether a key x occurs in a collection and, if so, where.
Algorithms · topic
Searching
Linear search counts, binary search with exact probe counts, first and last occurrence, lower and upper bound, rotated sorted arrays, interpolation and ternary search, and the comparison lower bound for searching.
Study this topic
Searching cheat sheets
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.