Lecture 5: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort

author: Erik Demaine, Center for Future Civic Media, Massachusetts Institute of Technology, MIT
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009,   recorded: September 2005,   views: 8377
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)

Slides

Related content

Report a problem or upload files

If 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.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

"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?...

See Also:

Download slides icon Download slides: mit6046jf05_demaine_lec05_01.pdf (261.1 KB)

Download Video - generic video source Download mit6046jf05_demaine_lec05_01.m4v (Video - generic video source 160.6 MB)

Download Video - generic video source Download mit6046jf05_demaine_lec05_01.rm (Video - generic video source 122.9 MB)

Download Video Download mit6046jf05_demaine_lec05_01.flv (Video 215.0 MB)

Download Video Download mit6046jf05_demaine_lec05_01.wmv (Video 678.2 MB)

Download audio transcript Download mit6046jf05_demaine_lec05_01.mp3 (Audio lecture 17.7 MB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 Marvon M. Newby, Jr., November 22, 2011 at 10:14 p.m.:

I enjoyed your lecture very much. I noticed that you did not include the PS9110 sorting algorithm that runs in O(n) time. It was presented at the Association of Information Technology Professional's National Collegiate Conference in Memphis, TN. I will look at your other lectures before commenting further.

Write your own review or comment:

make sure you have javascript enabled or clear this field: