Theoretical / proof-based
Algorithms · Undergraduate · CS / Programming
Topics
Proofs and complexity
- Correctness proofs for iterative and recursive algorithms
- Loop invariants and termination arguments
- Reductions and NP-completeness proofs (intro)
- Amortized analysis: aggregate and potential methods (intro)
- Randomized algorithms: expected runtime (intro)
Advanced graph and optimization
- Matching and bipartite graphs (intro)
- Approximation algorithms and ratio proofs (intro)
- Linear programming formulation of combinatorial problems (intro)
- Parametric search and binary search on answer (intro)
- Problem-solving strategies for proof-based exams
Pricing calculator
Choose materials, tutoring, or both — or book a single session as needed. Customize your plan on the subscribe page.
Billed in 15-minute increments (15-minute minimum, up to 4 hours). No subscription required.
$60.00 · 60 min · Undergraduate · Online ($60/hr)
Book through intake or schedule a session.