Algorithm design techniques

1. Divide and Conquer (Binary Search, Quick Sort, Merge Sort)
2. Dynamic Programming (Fibonacci Sequence, Knapsack Problem)
3. Greedy Algorithm (Dijkstra's Algorithm, Kruskal's Algorithm)
4. Backtracking (N-Queens Problem, Sudoku Solver)
5. Branch and Bound (Traveling Salesman Problem)
6. Randomized Algorithm (Monte Carlo Algorithm, Genetic Algorithm)
7. Approximation Algorithm (Travelling Salesman Problem)
8. Heuristic Algorithm (A* Algorithm, Dijkstra's Algorithm)
9. Meta-heuristic Algorithm (Genetic Algorithm, Particle Swarm Optimization)
10. Evolutionary Algorithm (Genetic Algorithm, Particle Swarm Optimization)