• i. Binary Search: Binary search finds the boundary of a monotone predicate in $O(\log (\text{range}))$ evaluations.
• ii. Ternary and Golden-Section Search: These find the extremum of a unimodal function (strictly increasing then strictly decreasing, or the reverse) with $O(\log )$ evaluations.
• iii. Sorting, Selection and Inversions: In contests you almost never write a sort.