List of redirects
Showing below up to 100 results in range #21 to #120.
View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)
- DFS → Depth-first search
- DP → Dynamic programming
- Dictionary → Map
- Difference array → Prefix sum array and difference array
- Dijkstra's → Dijkstra's algorithm
- Disjoint set → Disjoint sets
- Disjoint sets algorithm → Disjoint sets
- Disjoint sets data structure → Disjoint sets
- Double precision → IEEE 754
- Dynamic change → Dynamic programming
- Edmonds-Karp algorithm → Edmonds–Karp algorithm
- Euclid's algorithm → Greatest common divisor
- Euclidean algorithm → Greatest common divisor
- Extended Euclidean algorithm → Greatest common divisor
- Extended Eucliean algorithm → Extended Euclidean algorithm
- Floating-point → Floating-point data type
- Floating-point number → Floating-point data type
- Floating point → Floating-point data type
- Floating point data type → Floating-point data type
- Floating point number → Floating-point data type
- Flood fill → Graph search
- Floyd's → Floyd–Warshall algorithm
- Floyd's algorithm → Floyd–Warshall algorithm
- Floyd-Warshall → Floyd–Warshall algorithm
- Floyd-Warshall algorithm → Floyd–Warshall algorithm
- Floyd–Warshall → Floyd–Warshall algorithm
- Ford-Fulkerson algorithm → Ford–Fulkerson method
- Ford-Fulkerson method → Ford–Fulkerson method
- Ford–Fulkerson algorithm → Ford–Fulkerson method
- GCD → Greatest common divisor
- GCF → Greatest common divisor
- Graph → Graph theory
- Greatest common factor → Greatest common divisor
- Greedy → Greedy algorithm
- Haystack → String searching
- Heavy–light decomposition → Heavy-light decomposition
- IOI → International Olympiad in Informatics
- Invisible constant factor → Hidden constant factor
- Jarnik's algorithm → Prim's algorithm
- Jarnik-Prim → Prim's algorithm
- Jarník's algorithm → Prim's algorithm
- Jarník-Prim → Prim's algorithm
- Jarvis march → Convex hull
- KMP → Knuth–Morris–Pratt algorithm
- KMP algorithm → Knuth–Morris–Pratt algorithm
- Knuth-Morris-Pratt → Knuth–Morris–Pratt algorithm
- Knuth-Morris-Pratt algorithm → Knuth–Morris–Pratt algorithm
- Knuth–Morris–Pratt → Knuth–Morris–Pratt algorithm
- Kruskal's → Kruskal's algorithm
- LCA → Lowest common ancestor
- LCM → Least common multiple
- LIS → Longest increasing subsequence
- Least common ancestor → Lowest common ancestor
- Left half-open interval → Half-open interval
- Lexicographic ordering → Lexicographic order
- Lexicographical order → Lexicographic order
- Lexicographical ordering → Lexicographic order
- Longest decreasing subsequence → Longest increasing subsequence
- Lowest common multiple → Least common multiple
- Manacher's algorithm → Longest palindromic substring
- 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
