CP ALGORITHMS

ALGORITHMS
 CP-Algorithms Search Page Authors

E-Maxx Algorithms in English

The goal of this project is to translate the wonderful resource http://e-maxx.ru/algo
http://e-maxx.ru/algo which
 which provides descriptions of many algorithms and 
data structures especially popular in field of competitive programming. Moreover we want to improve the collected knowledge by 
extending the articles and adding new articles to the collection.

Articles

Algebra

Fundamentals
Binary Exponentiation
Euclidean algorithm for computing the greatest common divisor 
Extended Euclidean Algorithm
Linear Diophantine Equations
Fibonacci Numbers
Prime numbers
Sieve of Eratosthenes
Sieve of Eratosthenes With Linear Time Complexity
Number-theoretic functions
Euler's totient function
Number of divisors / sum of divisors
Modular arithmetic
Modular Inverse
Linear Congruence Equation
Chinese Remainder Theorem
Factorial modulo  p
Discrete Root
Primitive Root
Discrete Log
Number systems
Balanced Ternary
Gray code
Miscellaneous
Enumerating submasks of a bitmask
 Arbitrary-Precision
 Arbitrary-Precision Arithmetic
Arithmetic
Fast Fourier transform

Data Structures

Fundamentals
Minimum Stack / Minimum Queue
Sparse Table
Trees
Disjoint Set Union
Fenwick Tree
Sqrt Decomposition
Segment Tree
Treap
Sqrt Tree
Randomized Heap
Advanced
Deleting from a data structure in O(T(n)log n)

Dynamic Programming

DP optimizations
Divide and Conquer DP
Tasks
Dynamic Programming on Broken Profile. Problem "Parquet"
Finding the largest zero submatrix

String Processing
 Fundamentals
String Hashing
Rabin-Karp for String Matching
Prefix function
Z-function
Suffix Array
 Aho-Corasick
 Aho-Corasi ck algorithm
algorithm
Advanced
Suffix Tree
Suffix Automaton
Lyndon factorization
Tasks
Expression parsing
Finding all sub-palindromes in O(N)
Finding repetitions

Linear Algebra

Matrices
Gauss & System of Linear Equations
Gauss & Determinant
Kraut & Determinant
Rank of a matrix

Combinatorics

Fundamentals
Finding Power of Factorial Divisor 
Binomial Coefficients
Catalan Numbers
Techniques
The Inclusion-Exclusion Principle
Burnside's lemma / Pólya enumeration theorem
Stars and bars
Generating all K -combinations
Tasks
Placing Bishops on a Chessboard
Balanced bracket sequences
Counting labeled graphs

Numerical Methods

Search
Ternary Search
Newton's method for finding roots
Integration
Integration by Simpson's formula

Geometry

Elementary operations
Basic Geometry
Finding the equation of a line for a segment
Intersection Point of Lines
Check if two segments intersect
Intersection of Segments
Circle-Line Intersection
Circle-Circle Intersection
Length of the union of segments
Polygons
Oriented area of a triangle
 Area of simple
simple polygon
Check if points belong to the convex polygon in O(log N)
Pick's Theorem - area of lattice polygons
Lattice points of non-lattice polygon
Convex hull
Convex hull construction using Graham's Scan
Convex hull trick and Li Chao tree
Sweep-line
 Search for a pair of intersecting segments
Point location in O(log N)
Miscellaneous
Finding the nearest pair of points
Delaunay triangulation and Voronoi diagram

Graphs

Graph traversal
Breadth First Search
Depth First Search
Connected components, bridges, articulations points
Finding Connected Components
Finding Bridges in O(N+M)
Finding Bridges Online
Finding Articulation Points in O(N+M)
Strongly Connected Components and Condensation Graph
Single-source shortest paths
Dijkstra - finding shortest paths from given vertex
Dijkstra on sparse graphs
Bellman-Ford - finding shortest paths with negative weights
0-1 BFS
D´Esopo-Pape algorithm
All-pairs shortest paths
Floyd-Warshall - finding all shortest paths
Number of paths of fixed length / Shortest paths of fixed length
Spanning trees
Minimum Spanning Tree - Prim's Algorithm
Minimum Spanning Tree - Kruskal
Minimum Spanning Tree - Kruskal with Disjoint Set Union
Kirchhoff Theorem
Prüfer code
Cycles
Checking a graph for acyclicity and finding a cycle in O(M)
Finding a Negative Cycle in the Graph
Eulerian Path
Lowest common ancestor 
Lowest Common Ancestor 
Lowest Common Ancestor - Binary Lifting
Lowest Common Ancestor - Farach-Colton and Bender algorithm
Solve RMQ by finding LCA
Lowest Common Ancestor - Tarjan's off-line algorithm
Flows and related problems
Maximum flow - Ford-Fulkerson and Edmonds-Karp
Maximum
Maximum
Maximu m flow - Push-relabel algorithm
Maximum flow -
flow - Push-relabel algorithm improved
Maximum flow - Dinic's algorithm
Maximum flow - MPM algorithm
Flows with demands
Minimum-cost
Minimu m-cost flow
 Assignment
 As signment problem. Solution using min-cost-flow in O (N^5)
Matchings and related problems
Bipartite Graph Check
Miscellaneous
Miscellaneous
Topological Sorting
Edge connectivity / Vertex connectivity
Tree painting
2-SAT
Heavy-light
Heavy-li ght decomposition

Miscellaneous

Sequences
Seq uences
RMQ task (Range Minimum Query - the smallest element in an interval)
RMQ task
Longest increasing subsequence
subse quence
Search the subsegment
subsegment with the maximum/minimum sum
K-th order statistic in O(N)
Game Theory
Games on arbitrary graphs
Schedules
Schedules
 Scheduling jobs on one machine
Scheduling jobs on two machines
Optimal schedule of jobs given their deadlines and durations
Miscellaneous
Josephus problem
15 Puzzle Game: Existence Of The Solution
The Stern-Brocot Tree and Farey Sequences

Information for contributors  and Test-Your-Page form

(c) 2014-2018 translation by http://github.co

http://github.com/e-maxx-eng
m/e-maxx-eng 19:457/145