Divide & Conquer
	• Idea: – Break problem into pieces – Solve the pieces (recursively) – Put the pieces back together • Canonical example: – MergeSort				• Recursive algorithm that is relatively easy to design • Running time that is relatively easy to analyze – Time is given by a recurrence relation – Recurrence relation is typically not too difficult to solve
			CS409 - Spring 2000						1