[WF1] [SFE] 6.046J-18.410J Introduction to Algorithms (SMA 5503)番号下载_[WF1] [SFE] 6.046J-18.410J Introduction to Algorithms (SMA 5503)番号下载_[WF1] [SFE] 6.046J-18.410J Introduction to Algorithms (SMA 5503)下载

[WF1] [SFE] 6.046J-18.410J Introduction to Algorithms (SMA 5503)

种子简介

种子名称： [WF1] [SFE] 6.046J-18.410J Introduction to Algorithms (SMA 5503)
文件类型：
文件数目： 24个文件
文件大小： 2.81 GB
收录时间： 2008-8-17 01:37
已经下载： 3次
资源热度： 137
最近下载： 2024-12-24 23:57

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:8F3887F84146A7E5DF7CF4E437B8AE46EB41C0AA&dn=[WF1] [SFE] 6.046J-18.410J Introduction to Algorithms (SMA 5503) 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

WF1 SFE 6 046J-18 410J Introduction to Algorithms SMA 5503

种子包含的文件

[WF1] [SFE] 6.046J-18.410J Introduction to Algorithms (SMA 5503).torrent

6-046JFall-2005--Lecture Notes--Quizzes.zip8.17MB

[10] Red-black Trees, Rotations, Insertions, Deletions--ocw-6.046-19oct2005-220k.rm134.14MB

[11] Augmenting Data Structures, Dynamic Order Statistics, Interval Trees--ocw-6.046-24oct2005-220k(1).rm134MB

[12] Skip Lists -- ocw-6.046-26oct2005-220k.rm136.77MB

[13] Amortized Algorithms, Table Doubling, Potential Method -- ocw-6.046-31oct2005-220k.rm126.58MB

[14] Competitive Analysis Self-organizing Lists --ocw-6.046-02nov2005-220k(1).rm119.32MB

[15] Dynamic Programming, Longest Common Subsequence -- ocw-6.046-07nov2005-220k.rm113.63MB

[16] Greedy Algorithms, Minimum Spanning Trees --ocw-6.046-09nov2005-220k(1).rm134.75MB

[17] Shortest Paths I Properties, Dijkstra's Algorithm, Breadth-first Search--ocw-6.046-14nov2005-220k(1).rm135.42MB

[18] Shortest Paths II Bellman-Ford, Linear Programming, Difference Constraints --ocw-6.046-16nov2005-220k(1).rm123.95MB

[19] Shortest Paths III All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson --ocw-6.046-21nov2005-220k(1).rm119.94MB

[1] Analysis of Algorithms, Insertion Sort, Mergesort--ocw-6.046-07sep2005-220k(1).rm129.06MB

[20] Advanced Topics I -- ocw-6.046-05dec2005-220k.rm120.12MB

[21] Advanced Topics II -- ocw-6.046-07dec2005-220k.rm122.42MB

[22] Advanced Topics III--ocw-6.046-12dec2005-220k(1).rm136.51MB

[23] Advanced Topics IV -- Discussion of Follow-on Classes -- ocw-6.046-14dec2005-220k.rm136.51MB

[2] Asymptotic Notation, Recurrences, Master Method, substitution-- ocw-6.046-12sep2005-220k(1).rm113.6MB

[3] Divide-and-Conquer Strassen, Fibonacci, Polynomial Multiplication --ocw-6.046-14sep2005-220k(1).rm109.99MB

[4] Quicksort, Randomized Algorithms --ocw-6.046-21sep2005-220k(1).rm109.68MB

[5] Linear-time Sorting Lower Bounds, Counting Sort, Radix Sort --ocw-6.046-26sep2005-220k(1).rm122.88MB

[6] Order Statistics, Median --ocw-6.046-28sep2005-220k(1).rm110.15MB

[7] Hashing, Hash Functions--ocw-6.046-03oct2005-220k(1).rm124.53MB

[8] Universal Hashing, Perfect Hashing--ocw-6.046-05oct2005-220k(1).rm127.11MB

[9] Relation of BSTs to Quicksort--Analysis of Random BST--ocw-6.046-17oct2005-220k(1).rm130.19MB