Week 1~3

  • Preliminaries
  • Insertion sort
  • Performance analysis
  • Merge sort
  • Solving recurrences
    • substitution method
    • recursion-tree method
    • master method
  • Sorting - basic

Week 4~6

  • Decision tree
  • Quick sort
  • Sorting challenges
  • Count sort
  • Radix sort
  • Median and order statistics
  • Linear time selection
  • Dynamic programming
  • Longest common subsequence problem
  • 0-1 Knapsack problem