Introduction to Algorithms, 3rd Edition

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

Thomas H.Cormen

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

Charles E.Leiserson

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

Ronald L.Rivest

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

Clifford Stein

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

出版者:The MIT Press
作者:Thomas H. Cormen
出品人:
页数:1312
译者:
出版时间:2009-7-31
价格:USD 94.00
装帧:Hardcover
isbn号码:9780262033848
丛书系列:
图书标签:
  • 算法 
  • Algorithms 
  • 计算机 
  • 计算机科学 
  • 编程 
  • algorithm 
  • programming 
  • 经典 
  •  
想要找书就要到 图书目录大全
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

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.

具体描述

读后感

评分

评分

评分

记得小学时,有很长一段时间疯狂的迷霍金,四年级的寒假拿了一百块压岁钱去买了两本他的科普读物《时间简史》《果壳中的宇宙》,一本45一本42,虽说是科普读物且全书只有一个数学公式(E=MC²),当时仍然完全看不懂,只能看看画,但附赠书签里的一句话却让我印象深刻:阅读...  

评分

描述算法的这种书翻译一旦有错误,或者意思表达不到位,看起来就很吃力了。 第一次看算法导论是看的中文版。我是从头开始看的,一直看到图算法结束。读的时候主要追求速度,不少地方看的不是很明白。然而有些地方我觉得是翻译的问题导致理解上的障碍。 china-pub 上有人指出...  

评分

这本书和国内学者编写的算法教材有些差别。 首先,就像其他国外教材一样,该书讲解的很细致,习惯国内教材的读者可能觉得写得有点罗嗦,不过个人感觉很适合自学。 其次,每一章节最后都附有延伸阅读的建议,对于深入学习很有帮助。 最后,本书对算法的讲解使用的是伪码,不...  

用户评价

评分

质飞跃

评分

本科时候的教材 教授的俄罗斯口音基本听不懂 只有考着这本书撑了一学期 并且在期末考试拿了A

评分

这学期还离不开算法老师……

评分

质飞跃

评分

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

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

© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有