Data Structures
Binary Search on a Function (Ternary Search Alternative)
Binary search on a function: find the maximum of a unimodal function by comparing neighbouring values — a discrete alternative to ternary search.