Computer Science 332
Analysis of Algorithms
Dickinson College
Fall Semester 2003
Grant Braught
Class #10 - Divide and Conquer
Main Ideas For Today
- Divide and Conquer
- Merge Sort
- Master Theorem
Reading Assignment
- Levitin, Chapter 4, Section 4.1.
Lecture Slides
- Class #10 - Divide and Conquer
(Slides are only available for download from on-campus locations)
Homework Assigned Today
Due Date: 10/9/03
- Levitin, Exercises 4.1: #3, #5, #6, #10
NOTES: For #3(b) setup a recurrence for the step count of your algorithm and give a bound using the Master Theorem. For #6, give a figure similar to figure 4.2 in the text. For #10, describe your algorithm and how it fits the divide and conquer approach. You do not need to give pseudo-code.