Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Introduction to Algorithms
Video Lectures
Lecture 1: Algorithmic Thinking, Peak Finding (53:21)
Lecture 2: Models of Computation, Document Distance (48:51)
Lecture 3: Insertion Sort, Merge Sort (51:19)
Lecture 4: Heaps and Heap Sort (52:31)
Lecture 5: Binary Search Trees, BST Sort (52:39)
Lecture 6: AVL Trees, AVL Sort (51:58)
Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting (52:08)
Lecture 8: Hashing with Chaining (51:15)
Lecture 9: Table Doubling, Karp-Rabin (52:46)
Lecture 10: Open Addressing, Cryptographic Hashing (50:54)
Lecture 11: Integer Arithmetic, Karatsuba Multiplication (47:23)
Lecture 12: Square Roots, Newton's Method (51:16)
Lecture 13: Breadth-First Search (BFS) (50:47)
Lecture 14: Depth-First Search (DFS), Topological Sort (50:30)
Lecture 15: Single-Source Shortest Paths Problem (53:14)
Lecture 16: Dijkstra (51:25)
Lecture 17: Bellman-Ford (48:50)
Lecture 18: Speeding up Dijkstra (53:15)
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths (51:46)
Lecture 20: Dynamic Programming II: Text Justification, Blackjack (52:11)
Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack (52:40)
Lecture 22: Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros. (49:19)
Lecture 23: Computational Complexity (51:11)
Lecture 24: Topics in Algorithms Research (46:46)
Readings
Python Cost Model
Binary Search Trees
Assignments
Problem Set 1
Problem Set 2
Problem Set 3
Problem Set 4
Problem Set 5
Problem Set 6
Problem Set 7
Exams
Quiz 1
Quiz 2
Final Exam
Lecture 13: Breadth-First Search (BFS)
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock