Designing Algorithms

• Incremental Design
  • Iterative
  • Example: Insertion Sort

  
  

  
  

• Divide-and-Conquer
  • Recursive
  • Example: Merge Sort
  • 1. DIVIDE problem into smaller subproblems
  • 2. CONQUER subproblems by solving them recursively
  • 3. COMBINE solutions of subproblems