Deck · IOI — Competitive Programming
General Algorithmic Techniques & Analysis
Core IOI algorithmic toolkit: asymptotic and amortized analysis, recursion and recurrences, complete search and backtracking, divide and conquer, greedy methods, binary/ternary search, two pointers and sliding window, prefix sums and difference arrays, sorting, meet in the middle, bit manipulation, randomization, and invariant-based correctness reasoning. Emphasis on complexity and applicability.
79 cards · audited · SM-2 spaced repetition
Included with the full IOI — Competitive Programming program — 14 decks, 964 cards.
Sample cards
What does Big-O notation describe?
What do Θ (Theta) and Ω (Omega) notations mean?
Why are constant factors and lower-order terms dropped in asymptotic analysis?
Order these growth rates from slowest to fastest growing: O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ).
Roughly what input size n is feasible within ~1 second for O(n), O(n log n), O(n²), and O(2ⁿ)?
Showing 5 of 79 cards. Unlock the program to study them all.
More in IOI — Competitive Programming
Master general algorithmic techniques & analysis — and the rest of IOI — Competitive Programming.
One program. 964 audited cards across 14 decks.