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
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
Instructors: | |
Course Number: |
|
Departments: | |
As Taught In: | Fall 2011 |
Level: |
Undergraduate
|