Computer Science 385
Design and Analysis of Algorithms

Spring 2024, Siena College

Home     Syllabus     Schedule

Agenda

• Announcements
  • Wednesday schedule
  • Problem Set 2: [PDF] due Thursday morning
  • Lab 3: Brute-Force Closest Pairs wrap up if not yet done before lab
• Wrapping up the In-class group activity: Brute-Force Convex Hull (link in Canvas)
• Decrease and conquer algorithms
  • insertion sort, both iterative and recursive
• Analyzing recursive algorithms with recurrences

Terminology

• decrease and conquer
• decrease by one
• decrease by constant factor
• insertion sort
• recurrence relation
• stopping condition/base case of a recurrence