| [MIT] Introduction to algorithms/1-01 Lecture 01 Analysis of Algorithms, Insertion Sort, Mergesort.mp4 |
166.9 MB |
| [MIT] Introduction to algorithms/1-02 Lecture 02 Asymptotic Notation, Recurrences, Substitution, Master Method.mp4 |
145.7 MB |
| [MIT] Introduction to algorithms/1-03 Lecture 03 Divide-and-Conquer. Strassen, Fibonacci, Polynomial Multiplication.mp4 |
143.2 MB |
| [MIT] Introduction to algorithms/1-04 Lecture 04 Quicksort, Randomized Algorithms.mp4 |
167.7 MB |
| [MIT] Introduction to algorithms/1-05 Lecture 05 Linear-time Sorting. Lower Bounds, Counting Sort, Radix Sort.mp4 |
160.6 MB |
| [MIT] Introduction to algorithms/1-06 Lecture 06 Order Statistics, Median.mp4 |
144.1 MB |
| [MIT] Introduction to algorithms/1-07 Lecture 07 Hashing, Hash Functions.mp4 |
163.9 MB |
| [MIT] Introduction to algorithms/1-08 Lecture 08 Universal Hashing, Perfect Hashing.mp4 |
166.9 MB |
| [MIT] Introduction to algorithms/1-09 Lecture 09 Relation of BSTs to Quicksort, Analysis of Random BST.mp4 |
169.7 MB |
| [MIT] Introduction to algorithms/1-10 Lecture 10 Red-black Trees, Rotations, Insertions, Deletions.mp4 |
174.7 MB |
| [MIT] Introduction to algorithms/1-11 Lecture 11 Augmenting Data Structures, Dynamic Order Statistics, Interval Trees.mp4 |
175.2 MB |
| [MIT] Introduction to algorithms/1-12 Lecture 12 Skip Lists.mp4 |
179.2 MB |
| [MIT] Introduction to algorithms/1-13 Lecture 13 Amortized Algorithms, Table Doubling, Potential Method.mp4 |
166.5 MB |
| [MIT] Introduction to algorithms/1-14 Lecture 14 Competitive Analysis. Self-organizing Lists.mp4 |
155.4 MB |
| [MIT] Introduction to algorithms/1-15 Lecture 15 Dynamic Programming, Longest Common Subsequence.mp4 |
147.5 MB |
| [MIT] Introduction to algorithms/1-16 Lecture 16 Greedy Algorithms, Minimum Spanning Trees.mp4 |
172.6 MB |
| [MIT] Introduction to algorithms/1-17 Lecture 17 Shortest Paths I. Properties, Dijkstra's Algorithm, Breadth-first Search.mp4 |
174.5 MB |
| [MIT] Introduction to algorithms/1-18 Lecture 18 Shortest Paths II. Properties, Dijkstra's Algorithm, Breadth-first Search.mp4 |
159.8 MB |
| [MIT] Introduction to algorithms/1-19 Lecture 19 Shortest Paths III. All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson.mp4 |
155.9 MB |
| [MIT] Introduction to algorithms/1-20 Lecture 22 Advanced Topics.mp4 |
157.2 MB |
| [MIT] Introduction to algorithms/1-21 Lecture 23 Advanced Topics (cont.).mp4 |
161.3 MB |
| [MIT] Introduction to algorithms/1-22 Lecture 24 Advanced Topics (cont.).mp4 |
177.6 MB |
| [MIT] Introduction to algorithms/1-23 Lecture 25 Advanced Topics (cont.), Discussion of Follow-on Classes.mp4 |
178.9 MB |
| [MIT] Introduction to algorithms/Dynamic Algorithms Handout.pdf |
148 KB |
| [MIT] Introduction to algorithms/Final Exam Solutions.pdf |
189 KB |
| [MIT] Introduction to algorithms/Final Exam.pdf |
192 KB |
| [MIT] Introduction to algorithms/Lecture Notes 1 Analysis of Algorithms, Insertion Sort, Mergesort.pdf |
501 KB |
| [MIT] Introduction to algorithms/Lecture Notes 10 Red-black Trees, Rotations, Insertions, Deletions.pdf |
317 KB |
| [MIT] Introduction to algorithms/Lecture Notes 11 Augmenting Data Structures, Dynamic Order Statistics, Interval Trees.pdf |
305 KB |
| [MIT] Introduction to algorithms/Lecture Notes 12 Skip Lists.pdf |
300 KB |
| [MIT] Introduction to algorithms/Lecture Notes 13 Amortized Algorithms, Table Doubling, Potential Method.pdf |
296 KB |
| [MIT] Introduction to algorithms/Lecture Notes 14 Competitive Analysis. Self-organizing Lists.pdf |
283 KB |
| [MIT] Introduction to algorithms/Lecture Notes 15 Dynamic Programming, Longest Common Subsequence.pdf |
246 KB |
| [MIT] Introduction to algorithms/Lecture Notes 16 Greedy Algorithms, Minimum Spanning Trees.pdf |
405 KB |
| [MIT] Introduction to algorithms/Lecture Notes 17 Shortest Paths I. Properties, Dijkstra's Algorithm, Breadth-first Search.pdf |
451 KB |
| [MIT] Introduction to algorithms/Lecture Notes 18 Shortest Paths II. Properties, Dijkstra's Algorithm, Breadth-first Search.pdf |
287 KB |
| [MIT] Introduction to algorithms/Lecture Notes 19 Shortest Paths III. All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson.pdf |
312 KB |
| [MIT] Introduction to algorithms/Lecture Notes 2 Asymptotic Notation, Recurrences, Substitution, Master Method.pdf |
321 KB |
| [MIT] Introduction to algorithms/Lecture Notes 3 Divide-and-Conquer. Strassen, Fibonacci, Polynomial Multiplication.pdf |
327 KB |
| [MIT] Introduction to algorithms/Lecture Notes 4 Quicksort, Randomized Algorithms.pdf |
362 KB |
| [MIT] Introduction to algorithms/Lecture Notes 5 Linear-time Sorting. Lower Bounds, Counting Sort, Radix Sort.pdf |
261 KB |
| [MIT] Introduction to algorithms/Lecture Notes 6 Order Statistics, Median.pdf |
422 KB |
| [MIT] Introduction to algorithms/Lecture Notes 7 Hashing, Hash Functions.pdf |
223 KB |
| [MIT] Introduction to algorithms/Lecture Notes 8 Universal Hashing, Perfect Hashing.pdf |
222 KB |
| [MIT] Introduction to algorithms/Lecture Notes 9 Relation of BSTs to Quicksort, Analysis of Random BST.pdf |
319 KB |
| [MIT] Introduction to algorithms/Lecture Notes Skip Lists.pdf |
144 KB |
| [MIT] Introduction to algorithms/Practice Final Exam Solutions.pdf |
167 KB |
| [MIT] Introduction to algorithms/Practice Final.pdf |
127 KB |
| [MIT] Introduction to algorithms/Practice Quiz 1 Solutions.pdf |
150 KB |
| [MIT] Introduction to algorithms/Practice Quiz 1.pdf |
57 KB |
| [MIT] Introduction to algorithms/Problem Set 1 Solutions.pdf |
56 KB |
| [MIT] Introduction to algorithms/Problem Set 1.pdf |
51 KB |
| [MIT] Introduction to algorithms/Problem Set 2 Solutions.pdf |
201 KB |
| [MIT] Introduction to algorithms/Problem Set 2.pdf |
104 KB |
| [MIT] Introduction to algorithms/Problem Set 3 Solutions.pdf |
123 KB |
| [MIT] Introduction to algorithms/Problem Set 3.pdf |
79 KB |
| [MIT] Introduction to algorithms/Problem Set 4 Solutions.pdf |
112 KB |
| [MIT] Introduction to algorithms/Problem Set 4.pdf |
151 KB |
| [MIT] Introduction to algorithms/Problem Set 5 Solutions.pdf |
329 KB |
| [MIT] Introduction to algorithms/Problem Set 5.pdf |
166 KB |
| [MIT] Introduction to algorithms/Problem Set 6 Solutions.pdf |
152 KB |
| [MIT] Introduction to algorithms/Problem Set 6.pdf |
70 KB |
| [MIT] Introduction to algorithms/Problem Set 7 Solutions.pdf |
133 KB |
| [MIT] Introduction to algorithms/Problem Set 7.pdf |
124 KB |
| [MIT] Introduction to algorithms/Problem Set 8 Solutions.pdf |
123 KB |
| [MIT] Introduction to algorithms/Problem Set 8.pdf |
67 KB |
| [MIT] Introduction to algorithms/Problem Set 9 Solutions.pdf |
63 KB |
| [MIT] Introduction to algorithms/Problem Set 9.pdf |
28 KB |
| [MIT] Introduction to algorithms/Quiz 1 Solutions.pdf |
125 KB |
| [MIT] Introduction to algorithms/Quiz 1.pdf |
102 KB |
| [MIT] Introduction to algorithms/Quiz 2 Practice.pdf |
216 KB |
| [MIT] Introduction to algorithms/Quiz 2 Solutions.pdf |
130 KB |
| [MIT] Introduction to algorithms/Quiz 2.pdf |
105 KB |
| [MIT] Introduction to algorithms/Skip Lists Handout.pdf |
144 KB |
Magnet link
