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

author: Erik Demaine, Center for Future Civic Media
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009,   recorded: September 2005,   views: 7348
released under terms of: CC BY-NC-SA
You might be experiencing some problems with Your Video player.

# Slides

0:00 Slides Introduction to Algorithms - Lecture 5 How fast can we sort? Decision-tree example (1) Decision-tree example (2) Decision-tree example (3) Decision-tree example (4) Decision-tree example (5) Decision-tree example (6) Lower bound for decision-tree sorting Lower bound for comparison sorting Sorting in linear time Counting sort Counting-sort example Loop 1 Loop 2 (1) Loop 2 (2) Loop 2 (3) Loop 2 (4) Loop 2 (5) Loop 3 (1) Loop 3 (2) Loop 3 (3) Loop 4 (1) Loop 4 (2) Loop 4 (3) Loop 4 (4) Loop 4 (5) Analysis Running time Stable sorting Radix sort Operation of radix sort Correctness of radix sort (1) Correctness of radix sort (2) Correctness of radix sort (3) Analysis of radix sort (1) Analysis of radix sort (2) Choosing r Conclusions

# 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.

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