Binary search with a full trace, the divide-and-conquer pattern, and solving recurrences like T(n) = 2T(n/2) + n with the master theorem.