[MIT] Introduction to algorithms
File Information
File Size: 3.69 GB
Creat Time: 2014-11-23
Active Degree: 1663
Last Active: 2025-03-30
Magnet Link:
Magnet Link
Magnet Link
Statement: This site does not provide download links, only text displays, and does not contain any infringement.
File List
- 1-12 Lecture 12 Skip Lists.mp4 179.17 MB
- 1-23 Lecture 25 Advanced Topics (cont.), Discussion of Follow-on Classes.mp4 178.95 MB
- 1-22 Lecture 24 Advanced Topics (cont.).mp4 177.61 MB
- 1-11 Lecture 11 Augmenting Data Structures, Dynamic Order Statistics, Interval Trees.mp4 175.23 MB
- 1-10 Lecture 10 Red-black Trees, Rotations, Insertions, Deletions.mp4 174.70 MB
- 1-17 Lecture 17 Shortest Paths I. Properties, Dijkstra's Algorithm, Breadth-first Search.mp4 174.48 MB
- 1-16 Lecture 16 Greedy Algorithms, Minimum Spanning Trees.mp4 172.57 MB
- 1-09 Lecture 09 Relation of BSTs to Quicksort, Analysis of Random BST.mp4 169.69 MB
- 1-04 Lecture 04 Quicksort, Randomized Algorithms.mp4 167.69 MB
- 1-01 Lecture 01 Analysis of Algorithms, Insertion Sort, Mergesort.mp4 166.90 MB
- 1-08 Lecture 08 Universal Hashing, Perfect Hashing.mp4 166.90 MB
- 1-13 Lecture 13 Amortized Algorithms, Table Doubling, Potential Method.mp4 166.48 MB
- 1-07 Lecture 07 Hashing, Hash Functions.mp4 163.90 MB
- 1-21 Lecture 23 Advanced Topics (cont.).mp4 161.29 MB
- 1-05 Lecture 05 Linear-time Sorting. Lower Bounds, Counting Sort, Radix Sort.mp4 160.61 MB
- 1-18 Lecture 18 Shortest Paths II. Properties, Dijkstra's Algorithm, Breadth-first Search.mp4 159.75 MB
- 1-20 Lecture 22 Advanced Topics.mp4 157.19 MB
- 1-19 Lecture 19 Shortest Paths III. All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson.mp4 155.92 MB
- 1-14 Lecture 14 Competitive Analysis. Self-organizing Lists.mp4 155.40 MB
- 1-15 Lecture 15 Dynamic Programming, Longest Common Subsequence.mp4 147.46 MB
- 1-02 Lecture 02 Asymptotic Notation, Recurrences, Substitution, Master Method.mp4 145.73 MB
- 1-06 Lecture 06 Order Statistics, Median.mp4 144.08 MB
- 1-03 Lecture 03 Divide-and-Conquer. Strassen, Fibonacci, Polynomial Multiplication.mp4 143.19 MB
- Lecture Notes 1 Analysis of Algorithms, Insertion Sort, Mergesort.pdf 502 KB
- Lecture Notes 17 Shortest Paths I. Properties, Dijkstra's Algorithm, Breadth-first Search.pdf 451 KB
- Lecture Notes 6 Order Statistics, Median.pdf 423 KB
- Lecture Notes 16 Greedy Algorithms, Minimum Spanning Trees.pdf 405 KB
- Lecture Notes 4 Quicksort, Randomized Algorithms.pdf 363 KB
- Problem Set 5 Solutions.pdf 329 KB
- Lecture Notes 3 Divide-and-Conquer. Strassen, Fibonacci, Polynomial Multiplication.pdf 328 KB
- Lecture Notes 2 Asymptotic Notation, Recurrences, Substitution, Master Method.pdf 322 KB
- Lecture Notes 9 Relation of BSTs to Quicksort, Analysis of Random BST.pdf 320 KB
- Lecture Notes 10 Red-black Trees, Rotations, Insertions, Deletions.pdf 317 KB
- Lecture Notes 19 Shortest Paths III. All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson.pdf 313 KB
- Lecture Notes 11 Augmenting Data Structures, Dynamic Order Statistics, Interval Trees.pdf 306 KB
- Lecture Notes 12 Skip Lists.pdf 301 KB
- Lecture Notes 13 Amortized Algorithms, Table Doubling, Potential Method.pdf 297 KB
- Lecture Notes 18 Shortest Paths II. Properties, Dijkstra's Algorithm, Breadth-first Search.pdf 287 KB
- Lecture Notes 14 Competitive Analysis. Self-organizing Lists.pdf 283 KB
- Lecture Notes 5 Linear-time Sorting. Lower Bounds, Counting Sort, Radix Sort.pdf 262 KB
- Lecture Notes 15 Dynamic Programming, Longest Common Subsequence.pdf 247 KB
- Lecture Notes 7 Hashing, Hash Functions.pdf 224 KB
- Lecture Notes 8 Universal Hashing, Perfect Hashing.pdf 222 KB
- Quiz 2 Practice.pdf 217 KB
- Problem Set 2 Solutions.pdf 202 KB
- Final Exam.pdf 193 KB
- Final Exam Solutions.pdf 189 KB
- Practice Final Exam Solutions.pdf 168 KB
- Problem Set 5.pdf 167 KB
- Problem Set 6 Solutions.pdf 152 KB