Video details loaded
HomeMIT 6.042J Mathematics for Computer Science, Fall 2010Lecture 14: Divide and Conquer Recurrences

Lecture 14: Divide and Conquer Recurrences

1:22:46

Description: 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.

Speaker: Tom Leighton