List of redirects
Showing below up to 50 results in range #81 to #130.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Max flow → Maximum flow
- Max subvector sum → Maximum subvector sum
- Maximum flow problem → Maximum flow
- Memberlist → PEG:Memberlist
- Naïve algorithm → Naive algorithm
- Needle → String searching
- OI → Informatics olympiad
- Olympiad in informatics → Informatics olympiad
- Partial ordering → Partial order
- Partially ordered → Partial order
- Partially ordered set → Partial order
- Poset → Partial order
- Postprocess → Preprocessing and postprocessing
- Postprocessing → Preprocessing and postprocessing
- Precomputation → Preprocessing and postprocessing
- Precompute → Preprocessing and postprocessing
- Prefix sum array → Prefix sum array and difference array
- Preprocess → Preprocessing and postprocessing
- Preprocessing → Preprocessing and postprocessing
- Prim's → Prim's algorithm
- Prim-Jarnik → Prim's algorithm
- Prim-Jarník → Prim's algorithm
- Programming contest → Programming competition
- RMQ → Range minimum query
- Rabin-Karp → Rabin–Karp algorithm
- Rabin-Karp algorithm → Rabin–Karp algorithm
- Rabin–Karp → Rabin–Karp algorithm
- Recursion → Recursive function
- Recursive → Recursive function
- Recursively → Recursive function
- Right half-open interval → Half-open interval
- SPFA → Shortest Path Faster Algorithm
- Shortest paths → Shortest path
- Single precision → IEEE 754
- Stream → Sequence
- String matching → String searching
- String search → String searching
- Subsequence → Sequence
- Substring → String
- Topological sorting → Topological sort
- Total order → Partial order
- Total ordering → Partial order
- Totally ordered → Partial order
- Totally ordered set → Partial order
- Trailing zeros in factorial → Trailing zeroes in factorial
- Union-find → Disjoint sets
- Union-find algorithm → Disjoint sets
- Union-find data structure → Disjoint sets
- Warshall's → Floyd–Warshall algorithm
- Warshall's algorithm → Floyd–Warshall algorithm
