Introduction to Algorithms, 3rd Edition

Introduction to Algorithms, 3rd Edition pdf epub mobi txt 电子书 下载 2025

Thomas H. Cormen
想要找书就要到 静思书屋
立刻按 ctrl+D收藏本页
你会得到大惊喜!!
The MIT Press 2009-7-31 Hardcover 9780262033848

具体描述

Thomas H.Cormen

达特茅斯学院计算机科学系副教授

Charles E.Leiserson

麻省理工学院计算机科学与电气工程系教授

Ronald L.Rivest

麻省理工学院计算机科学系Andrew与Erna Viterbi具名教授

Clifford Stein

哥伦比亚大学工业工程与运筹学副教授

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.

As of the third edition, this textbook is published exclusively by the MIT Press.

用户评价

评分

评分

评分

##质飞跃

评分

评分

##在stanford上了cs161这本是必读书目

评分

##《算法导论》在我心目中的地位无疑是最高的。 第一次读到这个书,大约是在高一的时候。很荣幸地读到了南京大学翻译的《算法导论》第一版,名字叫《现代计算机常用数据结构和算法》。1994年出版,当时在国内是非常先进的译著。因为几乎是填补空白的作品,其中的诸多翻译处理得...  

评分

##07, 08年买的第二版, 后来又入了第三版, 终于慢慢读明白了. 只要主义真, 铁杵磨成针....

评分

评分

##如果你觉得TAOCP太厚了,那就读这本。虽然比起很多计算机算法书籍,这本书也是很厚的,它的确值得这么厚。 读了这本书,基本上就不需要再读其他的算法教科书了。  

本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou

© 2025 book.idnshop.cc All Rights Reserved. 静思书屋 版权所有