Today's topic is DivideAndConquer, concentrating on deterministic algorithms. The specific examples we will do are:

MergeSort:

*the*standard-issue boring divide-and-conquer algorithm.MedianFinding: a divide-and-conquer algorithm with an odd recurrence.

BinaryTrees: divide-and-conquer algorithms for the divide-and-conquer data structure.

IntegerMultiplication: multiply two two-digit numbers with three one-digit multiplications and amaze your friends!