种子简介
种子名称：
MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)
文件类型：
文件数目：
24个文件
文件大小：
2.57 GB
收录时间：
2014-1-12 12:47
已经下载：
3次
资源热度：
80
最近下载：
2025-1-5 02:25
下载BT种子文件
下载Torrent文件(.torrent)
立即下载
磁力链接下载
magnet:?xt=urn:btih:D7637BEEE4C32401682DD01E3CD86A38DF0ED9CA&dn=MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)
复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。
喜欢这个种子的人也喜欢
种子包含的文件
MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011).torrent
Lecture 10: Open Addressing, Cryptographic Hashing.mp4109.62MB
Lecture 11: Integer Arithmetic, Karatsuba Multiplication.mp4102.02MB
Lecture 12: Square Roots, Newton's Method.mp4110.38MB
Lecture 13: Breadth-First Search (BFS).mp4109.36MB
Lecture 14: Depth-First Search (DFS), Topological Sort.mp49.28MB
Lecture 15: Single-Source Shortest Paths Problem.mp4114.66MB
Lecture 16: Dijkstra.mp4199.04MB
Lecture 17: Bellman-Ford.mp4105.17MB
Lecture 18: Speeding up Dijkstra.mp4114.67MB
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths.mp4111.48MB
Lecture 1:Algorithmic Thinking, Peak Finding.mp4114.82MB
Lecture 20: Dynamic Programming II: Text Justification, Blackjack.mp4112.38MB
Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack.mp4113.44MB
Lecture 22: Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros..mp4106.22MB
Lecture 23: Computational Complexity.mp4110.25MB
Lecture 24: Topics in Algorithms Research.mp4100.71MB
Lecture 2: Models of Computation, Document Distance.mp4105.15MB
Lecture 3: Insertion Sort, Merge Sort.mp4110.47MB
Lecture 4: Heaps and Heap Sort.mp4113.11MB
Lecture 5: Binary Search Trees, BST Sort.mp4113.38MB
Lecture 6: AVL Trees, AVL Sort.mp4111.93MB
Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting.mp4112.26MB
Lecture 8: Hashing with Chaining.mp4110.19MB
Lecture 9: Table Doubling, Karp-Rabin.mp4113.63MB
本站已收录个 番号和无损神作磁力链接/BT种子
