Mathematics for Computer Science: Divide and Conquer Recurrences

Divide and Conquer Recurrences

Introduces the concept of recursion applied to various recurrence problems, such as the Towers of Hanoi and the Merge Sort algorithm, as well as their asymptotic analysis using the Akra-Bazzi method.