magnet:?xt=urn:btih:D7637BEEE4C32401682DD01E3CD86A38DF0ED9CA
Lecture 10: Open Addressing, Cryptographic Hashing.mp4 114.9 MBLecture 11: Integer Arithmetic, Karatsuba Multiplication.mp4 107.0 MBLecture 12: Square Roots, Newton's Method.mp4 115.7 MBLecture 13: Breadth-First Search (BFS).mp4 114.7 MBLecture 14: Depth-First Search (DFS), Topological Sort.mp4 9.7 MBLecture 15: Single-Source Shortest Paths Problem.mp4 120.2 MBLecture 16: Dijkstra.mp4 208.7 MBLecture 17: Bellman-Ford.mp4 110.3 MBLecture 18: Speeding up Dijkstra.mp4 120.2 MBLecture 19: Dynamic Programming I: Fibonacci, Shortest Paths.mp4 116.9 MBLecture 1:Algorithmic Thinking, Peak Finding.mp4 120.4 MBLecture 20: Dynamic Programming II: Text Justification, Blackjack.mp4 117.8 MBLecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack.mp4 119.0 MBLecture 22: Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros..mp4 111.4 MBLecture 23: Computational Complexity.mp4 115.6 MBLecture 24: Topics in Algorithms Research.mp4 105.6 MBLecture 2: Models of Computation, Document Distance.mp4 110.3 MBLecture 3: Insertion Sort, Merge Sort.mp4 115.8 MBLecture 4: Heaps and Heap Sort.mp4 118.6 MBLecture 5: Binary Search Trees, BST Sort.mp4 118.9 MB
list.txt~ 
README.txt 