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.
-
4. Divide and conquer
-
Readings Algoritmiek