MIT OpenCourseWare Introduction to Algorithms Fall 2011 Lecture 23 Computational Complexity mp4

MIT OpenCourseWare Introduction to Algorithms Fall 2011
Lecture 23 Computational Complexity mp4

Name	MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)	DOWNLOAD Copy Link Trouble downloading? see How To
Total Size	2.8 GB
Total Files	27
Hash	D7637BEEE4C32401682DD01E3CD86A38DF0ED9CA

/Lecture 23: Computational Complexity.mp4	115.6 MB
/Lecture 4: Heaps and Heap Sort.mp4	118.6 MB
/Lecture 18: Speeding up Dijkstra.mp4	120.2 MB
/Lecture 17: Bellman-Ford.mp4	110.3 MB
/Lecture 8: Hashing with Chaining.mp4	115.5 MB
/Lecture 16: Dijkstra.mp4	208.7 MB
/Lecture 3: Insertion Sort, Merge Sort.mp4	115.8 MB
/Lecture 6: AVL Trees, AVL Sort.mp4	117.4 MB
/Lecture 13: Breadth-First Search (BFS).mp4	114.7 MB
/Lecture 24: Topics in Algorithms Research.mp4	105.6 MB
/Lecture 9: Table Doubling, Karp-Rabin.mp4	119.1 MB
/Lecture 2: Models of Computation, Document Distance.mp4	110.3 MB
/Lecture 12: Square Roots, Newton's Method.mp4	115.7 MB
/Lecture 1:Algorithmic Thinking, Peak Finding.mp4	120.4 MB
/Lecture 5: Binary Search Trees, BST Sort.mp4	118.9 MB
Showing first 15 files of 27 total files