Skip to content

4. Hashing

416,711 views

About this video

Hand-picked by a BrighterTube curator · found via Developer-Y/cs-video-courses

Teaches the comparison-model lower bound for search and why hashing beats it, including hash functions, chaining and universal hashing. Taught by Erik Demaine, Jason Ku and Justin Solomon from MIT's current 6.006 syllabus, with board work that is easy to follow on video.

MIT 6.006, lecture 4: The comparison-model lower bound for search and why hashing beats it, including hash functions, chaining and universal hashing.

Video by MIT OpenCourseWare, played through YouTube's embedded player.

Part of MIT 6.006 Introduction to Algorithms, Spring 2020

Go deeper

As an Amazon Associate, BrighterTube earns from qualifying purchases. Picked by hand for this subject; nobody paid to be listed.