SEARCH COURSES

Introduction to Algorithms (SMA 5503MIT)

(47 Lectures Available)


Lecture Course Institute Discipline
Lecture 1 Algorithmic Thinking, Peak Finding Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 2 Models of Computation, Document Distance Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 3 Insertion Sort, Merge Sort Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 4 Heaps and Heap Sort Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 5 Binary Search Trees, BST Sort Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 6 AVL Trees, AVL Sort Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 7 Counting Sort, Radix Sort, Lower Bounds for Sorting Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 8 Hashing with Chaining Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 9 Table Doubling, Karp-Rabin Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 10 Open Addressing, Cryptographic Hashing Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 11 Integer Arithmetic, Karatsuba Multiplication Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 12 Square Roots, Newton’s Method Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 13 Breadth-First Search (BFS) Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 14 Depth-First Search (DFS), Topological Sort Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 15 Single-Source Shortest Paths Problem Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 16 Dijkstra Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 17 Bellman-Ford Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 18 Speeding up Dijkstra Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 19 Dynamic Programming I Fibonacci, Shortest Paths Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 20 Dynamic Programming II Text Justification, Blackjack Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 21 Dynamic Programming III Parenthesization, Edit Distance, Knapsack Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 22 Dynamic Programming IV Guitar Fingering, Tetris, Super Mario Bros. Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 23 Computational Complexity Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
Lecture 24 Topics in Algorithms Research Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences
 Recitation 1 Asymptotic Complexity, Peak Finding Introduction to Algorithms (SMA 5503MIT) MIT Basic Sciences

of 2 47 Lectures Available.