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
Lecture Videos
Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting
| Instructors: | |
| Course Number: |
|
| Departments: | |
| As Taught In: | Fall 2011 |
| Level: |
Undergraduate
|
Learning Resource Types
theaters
Lecture Videos
theaters
Recitation Videos
assignment_turned_in
Problem Sets with Solutions
grading
Exams with Solutions
assignment_turned_in
Programming Assignments with Examples
notes
Lecture Notes