Lecture 4: Quicksort, Randomized Algorithms
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: September 2005, views: 14558
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. Today we are going to talk about a very interesting algorithm called Quicksort -- -- which was invented by Tony Hoare in 1962. And it has ended up being a really interesting algorithm from many points of view. And because of that, it turns out today's lecture is going to be both hard and fast. If you see the person next to you sleeping, you will want to say let's get going. It's a divide-and-conquer algorithm..."
Download slides: mit6046jf05_leiserson_lec04_01.pdf (362.1 KB)
Download mit6046jf05_leiserson_lec04_01.m4v (Video - generic video source 167.7 MB)
Download mit6046jf05_leiserson_lec04_01.rm (Video - generic video source 128.9 MB)
Download mit6046jf05_leiserson_lec04_01.flv (Video 226.0 MB)
Download mit6046jf05_leiserson_lec04_01.wmv (Video 703.6 MB)
Download mit6046jf05_leiserson_lec04_01.mp3 (Audio lecture 18.6 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !