Explore Big O, recursion, binary search, and backtracking one step at a time. — 10 entries
An asymptotic upper bound on how work grows with input size.
A function calls itself on smaller instances and returns at a base case.
Split a problem, solve its parts, and combine their results.
Check the middle of a sorted range and discard half the candidates.
Move two indices through data to test a condition in one pass.
Move a contiguous window and update only what leaves and enters.
Store running totals to answer contiguous range sums quickly.
Tries a choice, reverses it when it cannot lead to a solution, and tests another.
Builds a solution by committing to the best-looking local choice at each step.
Estimates a hard-to-compute quantity through repeated random samples.
