Computer Science 385
Design and Analysis of Algorithms
Spring 2026, Siena University
Lecture 13: Decrease and Conquer Algorithms; Solving Recurrences
Date: Monday, February 23, 2026
Agenda
- Announcements
- grading update on PS 2 and Exam 1
- Convex hull in-class activity will wrap up Friday instead of
today
- Problem Set 3: [PDF] out
- Empirical Study 1: [PDF] introduction
- Decrease and conquer algorithms
- insertion sort, both iterative and recursive
- setting up and solving recurrences
Terminology
- decrease and conquer
- decrease by one
- decrease by constant factor
- insertion sort
Links