Lecture 2 Part 1

3, CS-250 Algorithms

  • Recap from last lecture
  • Divide-and-conquer approach
  • Description of merge sort