Navigation - Cp Algorithms

Home
Algebra
- Fundamentals
- Prime numbers
- Number-theoretic functions
  - Euler's totient function
  - Number of divisors / sum of divisors
- Modular arithmetic
- Number systems
  - Balanced Ternary
  - Gray code
- Miscellaneous
Data Structures
- Fundamentals
  - Minimum Stack / Minimum Queue
  - Sparse Table
- Trees
- Advanced
  - Deleting from a data structure in O(T(n) log n)
Dynamic Programming
String Processing
- Fundamentals
- Advanced
- Tasks
Linear Algebra
- Matrices
Combinatorics
- Fundamentals
- Techniques
- Tasks
Numerical Methods
- Search
- Integration
  - Integration by Simpson's formula
Geometry
Graphs
- Graph traversal
  - Breadth First Search
  - Depth First Search
- Connected components, bridges, articulations points
- Single-source shortest paths
- All-pairs shortest paths
  - Floyd-Warshall - finding all shortest paths
  - Number of paths of fixed length / Shortest paths of fixed length
- Spanning trees
- Cycles
- Lowest common ancestor
- Flows and related problems
- Matchings and related problems
- Miscellaneous
Miscellaneous