发帖
雷达卡
算法导论（2版+答案；3版）
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, "Introduction to Algorithms, Third Edition"
English | 2009-07-31 | ISBN: 0262033844 | 1312 pages | PDF | 5.4 mb
2版及其答案；3版（全为英文）打包在一起，约15mb, 收费：0币+回复。
Introduction_to_Algorithms_3rd_Edition.rar
(16.38 MB)
本附件包括：- Introduction_to_Algorithms_3rd_Edition.pdf
- Introduction to Algorithms_2版.pdf
- Solutions for Introduction to algorithms 2版.pdf
教材简介：北美最流行的算法导论教材，其实已是世间最流行的教材。由达特茅斯学院、麻省理工学院和哥伦比亚大学三校四位大牛所写。
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called “Divide-and-Conquer”). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition.
提升卡
置顶卡
沉默卡
变色卡
抢沙发
千斤顶
显身卡
京公网安备 11010802022788号
