Lecture 2: Asymptotic Notation, Recurrences, Substitution, Master Method
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: September 2005, views: 33811
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
"My name is Erik Demaine. You should call me Erik. Welcome back to 6.046. This is Lecture 2. And today we are going to essentially fill in some of the more mathematical underpinnings of Lecture 1. So, Lecture 1, we just sort of barely got our feet wet with some analysis of algorithms, insertion sort and mergesort. And we needed a couple of tools. We had this big idea of asymptotics and forgetting about constants, just looking at the lead term. And so, today, we're going to develop asymptotic notation so that we know that mathematically. And we also ended up with a recurrence with mergesort, the running time of mergesort, so we need to see how to solve recurrences. And we will do those two things today. Question? Yes, I will speak louder. Thanks. Good..."
Download slides: mit6046jf05_demaine_lec02_01.pdf (321.1 KB)
Download mit6046jf05_demaine_lec02_01.m4v (Video - generic video source 145.7 MB)
Download mit6046jf05_demaine_lec02_01.rm (Video - generic video source 112.8 MB)
Download mit6046jf05_demaine_lec02_01.flv (Video 195.5 MB)
Download mit6046jf05_demaine_lec02_01.wmv (Video 614.0 MB)
Download mit6046jf05_demaine_lec02_01.mp3 (Audio lecture 16.3 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !