Lecture 13: Amortized Algorithms, Table Doubling, Potential Method
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: October 2005, views: 5930
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.
"OK, good morning. So today we are going to, as I mentioned last week, we've started the part of the course where we are doing more things having to do with design than purely analysis. Today, we're actually going to do analysis, but it's the type of analysis that leads to really interesting design issues. And we're going to follow it up on Wednesday with an application of the methods we're going to learn today with a really interesting and practical problem. So we're talking today about amortized analysis..."
Download slides: mit6046jf05_leiserson_lec13_01.pdf (296.5 KB)
Download mit6046jf05_leiserson_lec13_01.m4v (Video - generic video source 166.5 MB)
Download mit6046jf05_leiserson_lec13_01.rm (Video - generic video source 126.6 MB)
Download mit6046jf05_leiserson_lec13_01.flv (Video 223.6 MB)
Download mit6046jf05_leiserson_lec13_01.wmv (Video 692.8 MB)
Download mit6046jf05_leiserson_lec13_01.mp3 (Audio lecture 18.3 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !