| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 10: Open Addressing, Cryptographic Hashing.mp4 |
109.6 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 11: Integer Arithmetic, Karatsuba Multiplication.mp4 |
102 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 12: Square Roots, Newton's Method.mp4 |
110.4 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 13: Breadth-First Search (BFS).mp4 |
109.4 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 14: Depth-First Search (DFS), Topological Sort.mp4 |
9.3 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 15: Single-Source Shortest Paths Problem.mp4 |
114.7 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 16: Dijkstra.mp4 |
199 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 17: Bellman-Ford.mp4 |
105.2 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 18: Speeding up Dijkstra.mp4 |
114.7 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths.mp4 |
111.5 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 1:Algorithmic Thinking, Peak Finding.mp4 |
114.8 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 20: Dynamic Programming II: Text Justification, Blackjack.mp4 |
112.4 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack.mp4 |
113.4 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 22: Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros..mp4 |
106.2 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 23: Computational Complexity.mp4 |
110.3 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 24: Topics in Algorithms Research.mp4 |
100.7 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 2: Models of Computation, Document Distance.mp4 |
105.2 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 3: Insertion Sort, Merge Sort.mp4 |
110.5 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 4: Heaps and Heap Sort.mp4 |
113.1 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 5: Binary Search Trees, BST Sort.mp4 |
113.4 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 6: AVL Trees, AVL Sort.mp4 |
111.9 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting.mp4 |
112.3 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 8: Hashing with Chaining.mp4 |
110.2 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/Lecture 9: Table Doubling, Karp-Rabin.mp4 |
113.6 MB |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/list.txt~ |
781 B |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/README.txt |
402 B |
| MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)/README.txt~ |
379 B |
Magnet link
