文件名称:
麻省理工：Introduction.to.Algorithms
开发工具:
文件大小: 12mb
下载次数: 0
上传时间: 2011-03-02
详细说明： 麻省理工算法导论(英文版) Part I: Foundations(9--109/100) Chapter 1: The Role of Algorithms in Computing Chapter 2: Getting Started Chapter 3: Growth of Functions Chapter 4: Recurrences Chapter 5: Probabilistic Analysis and Randomized Algorithms Part II: Sorting and Order Statistics(109--172/63) Chapter 6: Heapsort Chapter 7: Quicksort Chapter 8: Sorting in Linear Time Chapter 9: Medians and Order Statistics Part III: Data Structures(172--276/103) Chapter 10: Elementary Data Structures Chapter 11: Hash Tables Chapter 12: Bi nary Search Trees Chapter 13: Red-Black Trees Chapter 14: Augmenting Data Structures Part IV: Advanced Design and Analysis Techniques(276--369/93) Chapter 15: Dynamic Programming Chapter 16: Greedy Algorithms Chapter 17: Amortized Analysis Part V: Advanced Data Structures(369--444/75) Chapter 18: B-Trees Chapter 19: Binomial Heaps Chapter 20: Fibonacci Heaps Chapter 21: Data Structures for Disjoint Sets Part VI: Graph Algorithms(444--598/145) Chapter 22: Elementary Graph Algorithms Chapter 23: Minimum Spanning Trees Chapter 24: Single-Source Shortest Paths Chapter 25: All-Pairs Shortest Paths Chapter 26: Maximum Flow Part VII: Selected Topics(598--919/321) Chapter 27: Sorting Networks Chapter 28: Matrix Operations Chapter 29: Linear Programming Chapter 30: Polynomials and the FFT Chapter 31: Number-Theoretic Algorithms Chapter 32: String Matching Chapter 33: Computational Geometry Chapter 34: NP-Completeness Chapter 35: Approximation Algorithms Part VIII: Appendix: Mathematical Background(919--984/65) Appendix A: Summations Appendix B: Sets, Etc. Appendix C: Counting and Probability ...展开收缩
(系统自动生成,下载前可以参看下载内容)
下载文件列表
相关说明
- 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
- 本站是交换下载平台，提供交流渠道，下载内容来自于网络，除下载问题外，其它问题请自行百度。
- 本站已设置防盗链，请勿用迅雷、QQ旋风等多线程下载软件下载资源，下载后用WinRAR最新版进行解压.
- 如果您发现内容无法下载，请稍后再次尝试；或者到消费记录里找到下载记录反馈给我们.
- 下载后发现下载的内容跟说明不相乎，请到消费记录里找到下载记录反馈给我们，经确认后退回积分.
- 如下载前有疑问，可以通过点击"提供者"的名字，查看对方的联系方式，联系对方咨询.
