The following pages link to Greedy algorithm
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Algorithm (links | edit)
- Bell Labs (links | edit)
- Binary search (links | edit)
- Eight queens puzzle (links | edit)
- Hash function (links | edit)
- Huffman coding (links | edit)
- Iterative method (links | edit)
- Knapsack problem (links | edit)
- List of algorithms (links | edit)
- Minimax (links | edit)
- Newton's method (links | edit)
- Online algorithm (links | edit)
- Regular expression (links | edit)
- Search algorithm (links | edit)
- Sorting algorithm (links | edit)
- TeX (links | edit)
- Travelling salesman problem (links | edit)
- Quadratic programming (links | edit)
- Minimum spanning tree (links | edit)
- Linear programming (links | edit)
- Goldbach's conjecture (links | edit)
- Dijkstra's algorithm (links | edit)
- Mathematical optimization (links | edit)
- Kruskal's algorithm (links | edit)
- Ford–Fulkerson algorithm (links | edit)
- Prim's algorithm (links | edit)
- Merkle–Hellman knapsack cryptosystem (links | edit)
- Breadth-first search (links | edit)
- A* search algorithm (links | edit)
- Brute-force search (links | edit)
- Dynamic programming (transclusion) (links | edit)
- Best-first search (links | edit)
- Root-finding algorithm (links | edit)
- Link-state routing protocol (links | edit)
- Simulated annealing (links | edit)
- Online analytical processing (links | edit)
- Distributed hash table (links | edit)
- Borůvka's algorithm (links | edit)
- Divide-and-conquer algorithm (links | edit)
- Gradient descent (links | edit)
- Bellman–Ford algorithm (links | edit)
- Floyd–Warshall algorithm (links | edit)
- Backtracking (links | edit)
- Edmonds–Karp algorithm (links | edit)
- Optimal substructure (links | edit)
- Matroid (links | edit)
- Clique problem (links | edit)
- Horizon effect (links | edit)
- Automatic label placement (links | edit)
- Glossary of graph theory (links | edit)