Lecture Videos
Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting
Description: 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.
Instructor: Erik Demaine
Course Info
Instructors
Departments
As Taught In
Fall
2011
Level
Course Info
Instructors
Departments
As Taught In
Fall
2011
Level
Learning Resource Types
grading
Exam Solutions
grading
Exams
notes
Lecture Notes
theaters
Lecture Videos
assignment_turned_in
Problem Set Solutions
assignment
Problem Sets
theaters
Problem-solving Videos
assignment_turned_in
Programming Assignments with Examples
