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

Published: Dec. 7, 2012, 7:33 p.m.

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.