List of redirects
Showing below up to 50 results in range #1 to #50.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Abstract data type → Data structure
- All-pairs shortest paths → Shortest path
- BFS → Breadth-first search
- Bellman-Ford → Bellman–Ford algorithm
- Bellman-Ford algorithm → Bellman–Ford algorithm
- Bignum → Big numbers
- Bignums → Big numbers
- Binary32 → IEEE 754
- Binary64 → IEEE 754
- Binary GCD algorithm → Greatest common divisor
- Binomial queue → Binomial heap
- CCC → Canadian Computing Competition
- CCO → Canadian Computing Competition
- Canadian Computing Olympiad → Canadian Computing Competition
- Case-insensitive → Case sensitivity
- Change-making problem → Change problem
- Convex hull optimization → Convex hull trick
- Convex hull optimization technique → Convex hull trick
- Convex hull optimization trick → Convex hull trick
- DAG → Directed acyclic graph
- 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
