Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting

Name: Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting
Uploaded: 2013-01-14T20:26:48Z
Duration: 52 min 9 s
Description: 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

52:09

Up Next

Lecture 8: Hashing with Chaining

Continue

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