Skip to content
Hallway
0:00 / 0:00

#countingsort#radixsort#sortingalgorithms

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

MIT OpenCourseWare

6.5M subscribers • 37 videos on Hallway • University channel

YouTube
  • Recommended by 2 people: 1 in engineering communities and 1 curated list.
  • Presented by Erik Demaine, Professor at MIT

Intermediate. Assumes working knowledge.

429K views13 years ago2 recommendations

Computer scienceAlgorithmsData structuresComputation and complexity

Erik Demaine teaches linear-time sorting algorithms, including counting sort and radix sort, and explains the lower bounds of comparison-based sorting.

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: ocw.mit.edu/6-006F11 Instructor: Erik Demaine License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu

Why it's here

2 people recommend this

What people say. Recommended as an excellent lecture on linear-time sorting algorithms and their constraints.

Coding Interview Universitycurated list on GitHubRecommends

Under “Sorting”

Radix Sort, Counting Sort (linear time given constraints) (video)
View the list

u/fmapthrowawayin r/haskell • Recommends

On “Why does `sort` in Data.Discrimination claim to be O(n)?”

A nice lecture on linear-time sorting (from MIT OCW): link to this video
3View on Reddit