Home / Lectures / Introduction to Algorithms
Computer Science
Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting
- Course
- Introduction to Algorithms
- Instructor
- Erik Demaine
- Department
- Electrical Engineering and Computer Science
- Recorded
- Fall 2011
- Level
- Undergraduate
Free account required. The lecture opens at MIT OpenCourseWare.
About this lecture
This lecture starts by using the comparison model to prove lower bounds for searching and sorting, and then discusses counting sort and radix sort, which run in linear time.
More in Computer Science
Computer Science
Lecture 1: What is Computation?
Introduction to Computer Science and Programming in Python · Dr. Ana Bell
Computer Science
Lecture 2: Branching and Iteration
Introduction to Computer Science and Programming in Python · Dr. Ana Bell
Computer Science
Lecture 3: String Manipulation, Guess and Check, Approximations, Bisection
Introduction to Computer Science and Programming in Python · Dr. Ana Bell