Algorithmic Thinking & Peak Finding in 1D and 2D
53:21Models of Computation, Random Access Machine & Document Distance
48:51Insertion Sort, Binary Insertion & Merge Sort Recurrences
51:19Priority Queues, Binary Heaps & O(n) Build-Max-Heap
52:32Binary Search Trees & Runway Reservation Scheduling
52:39AVL Trees, Tree Rotations & Guaranteed O(log n) Height
51:59Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort
52:08Hashing with Chaining, Simple Uniform Hashing & Universal Families
51:15Table Doubling, Karp-Rabin
52:47Open Addressing, Cryptographic Hashing
50:55Integer Arithmetic, Karatsuba Multiplication
47:24Square Roots, Newton's Method
51:17Breadth-First Search (BFS)
50:48Depth-First Search (DFS), Topological Sort
50:31Single-Source Shortest Paths Problem
53:15Dijkstra
51:26Bellman-Ford
48:51Speeding up Dijkstra
53:16Dynamic Programming I: Fibonacci, Shortest Paths
51:47Dynamic Programming II: Text Justification, Blackjack
52:12Dynamic Programming III: Parenthesization, Edit Distance, Knapsack
52:41Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros.
49:20Table Doubling, Karp-Rabin
This lecture explores the table doubling technique for dynamic array resizing and introduces the Karp-Rabin string matching algorithm, examining its probabilistic hashing approach.
MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Erik Demaine
More courses at http://ocw.mit.edu
Hashing with Chaining, Simple Uniform Hashing & Universal Families
Next · Lecture 10Open Addressing, Cryptographic Hashing