Computer Science 385
 Design and Analysis of Algorithms 
 
 Spring 2019, Siena College 
Lecture 19: Divide and Conquer Algorithms
Date: Friday, March 8, 2019
 Agenda 
- Announcements
- Problem Set 3: [HTML] [PDF] code due today, writeup due Monday
 - Problem Set 4: [PDF] form groups (by sending an email) by today
 - Academic Celebration Project: [HTML] [PDF]: be thinking about groups and what you might want to do
 - Lab 6: Working With Recurrences due in lab next week for those who did not finish up
 
 - Lab 5: Graph Traversals quick recap
 - Divide and conquer
- closest pairs
 - Quickhull
 - Strassen's algorithm
 
 
 Terminology 
- divide-and-conquer closest pairs
 - quickhull
 - matrix-matrix multiplication