18.410J Introduction to Algorithms (SMA 5503)

Video Lectures

Displaying all 23 video lectures.
Lecture 1
Administrivia - Introduction - Analysis of Algorithms, Insertion Sort, Mergesort
Play Video
Administrivia - Introduction - Analysis of Algorithms, Insertion Sort, Mergesort
Lecture 2
Asymptotic Notation - Recurrences - Substitution, Master Method
Play Video
Asymptotic Notation - Recurrences - Substitution, Master Method
Lecture 3
Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication
Play Video
Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication
Lecture 4
Quicksort, Randomized Algorithms
Play Video
Quicksort, Randomized Algorithms
Lecture 5
Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
Play Video
Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
Lecture 6
Order Statistics, Median
Play Video
Order Statistics, Median
Lecture 7
Hashing, Hash Functions
Play Video
Hashing, Hash Functions
Lecture 8
Universal Hashing, Perfect Hashing
Play Video
Universal Hashing, Perfect Hashing
Lecture 9
Relation of BSTs to Quicksort - Analysis of Random BST
Play Video
Relation of BSTs to Quicksort - Analysis of Random BST
Lecture 10
Red-black Trees, Rotations, Insertions, Deletions
Play Video
Red-black Trees, Rotations, Insertions, Deletions
Lecture 11
Augmenting Data Structures, Dynamic Order Statistics, Interval Trees
Play Video
Augmenting Data Structures, Dynamic Order Statistics, Interval Trees
Lecture 12
Skip Lists
Play Video
Skip Lists
Lecture 13
Amortized Algorithms, Table Doubling, Potential Method
Play Video
Amortized Algorithms, Table Doubling, Potential Method
Lecture 14
Competitive Analysis: Self-organizing Lists
Play Video
Competitive Analysis: Self-organizing Lists
Lecture 15
Dynamic Programming, Longest Common Subsequence
Play Video
Dynamic Programming, Longest Common Subsequence
Lecture 16
Greedy Algorithms, Minimum Spanning Trees
Play Video
Greedy Algorithms, Minimum Spanning Trees
Lecture 17
Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search
Play Video
Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search
Lecture 18
Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints
Play Video
Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints
Lecture 19
Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson
Play Video
Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson
Lecture 22
Advanced Topics
Play Video
Advanced Topics
Lecture 23
Advanced Topics (cont.)
Play Video
Advanced Topics (cont.)
Lecture 24
Advanced Topics (cont.)
Play Video
Advanced Topics (cont.)
Lecture 25
Advanced Topics (cont.) - Discussion of Follow-on Classes
Play Video
Advanced Topics (cont.) - Discussion of Follow-on Classes