Lecture 5: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: September 2005, views: 40077
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.
"Today we're going to talk about sorting, which may not come as such a big surprise. We talked about sorting for a while, but we're going to talk about it at a somewhat higher level and question some of the assumptions that we've been making so far. And we're going to ask the question how fast can we sort? A pretty natural question. You may think you know the answer. Perhaps you do. Any suggestions on what the answer to this question might be? There are several possible answers. Many of them are partially correct. Let's hear any kinds of answers you'd like and start waking up this fresh morning. Sorry?...
Download slides: mit6046jf05_demaine_lec05_01.pdf (261.1 KB)
Download mit6046jf05_demaine_lec05_01.m4v (Video - generic video source 160.6 MB)
Download mit6046jf05_demaine_lec05_01.rm (Video - generic video source 122.9 MB)
Download mit6046jf05_demaine_lec05_01.flv (Video 215.0 MB)
Download mit6046jf05_demaine_lec05_01.wmv (Video 678.2 MB)
Download mit6046jf05_demaine_lec05_01.mp3 (Audio lecture 17.7 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !