MIT 6.042J Mathematics for Computer Science, Fall 2010 - Lec 14 | MIT 6.042J Mathematics for Computer Science, Fall 2010

5.0 (0)

4 learners

What you'll learn

This course includes

33 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

recurrences Towers of Hanoi Akra-Bazzi recursion merge sort asymptotic runtime

Full Transcript

Lecture 14: Divide and Conquer Recurrences Instructor: Tom Leighton View the complete course: http://ocw.mit.edu/6-042JF10 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Welcome