Examples of Algorithm

Divide & Conquer

• Binary search
• Multiplication of two n-bits numbers
• Quick Sort
• Heap Sort
• Merge Sort

Greedy Method

• Knapsack (Fractional) Problem
• Minimum Cost Spanning Tree
  • Kruskal‟s algorithm
  • Prim‟s algorithm
• Single Source Shortest Path Problem
• Dijkstra’s Algorithm

Dynamic Programming

• All Pair Shortest Path-Floyed Algorithm
• Chain Matrix Multiplication
• Longest Common Subsequence (LCS)
• 0/1 Knapsack Problem
• Traveling Salesmen Problem (TSP)

Backtracking

• N-Queen’s Problem
• Sum-of Subset

Branch & Bound

• Assignment Problem
• Traveling Salesmen Problem (TSP)