Algorithms

It’s a method or recipe for solving various problems.

Euclid’s greatest common divisor algorithm from over 2000 years ago is still one of the best ways of getting the GCD.

Related Topics:

• Asymptotic Bounding (Big O)
• CYK Algorithm
• Dijkstra’s Algorithm
• Dynamic Programming
• Efficiency in Algorithms
• Greedy Algorithms
• Heap (Data Structure)
• HeapSort
• Knapsack Problem
• Topological Ordering
• Vertex Cover