MIT

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

Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceEngineering

Om kurset

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