The concept of divide and conquer is illustrated by merge sort, closest pair of points, and integer multiplication. Since such algorithms generally are recursive, the analysis of the run time results in a recurrence relation. Therefore the Master theorem is explained and used to be able to express the run time directly.

Recorded lectures:

• “Introduction to divide and conquerl” please watch until 9:30
• “Recurrence relations” last slide gives information to TU Delft students
• “Solving recurrences”  please watch until 50:30
• “Counting inversions”  please watch until 1:09:00
• “Closest pair of points” last slide gives information to TU Delft students
• “Integer multiplication”  last slide gives information to TU Delft students

Slides:
Slides with thanks to Kevin Wayne and Pearson Education (made available together with the book “Algorithm Design” by Kleinberg & Tardos)