This section introduces the concept of algorithms, and defines what it means when we talk about an algorithm's efficiency. It also introduces various algorithms for the sorting problem, introducing you to techniques such as recursion, divide-and-conquer, heaps, etc.
- Why algorithms? + Sorting algorithms
- Binary search + Dynamic Programming + Matrix Exponentiation
- Graph Algorithms
- Segment Trees + Binary Indexed Trees + MO's algorithm
- Number Theory + Computational Geometry + Miscellaeneous