具體描述
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.
用戶評價
##沒看完。
評分##讀瞭個大概
評分##質飛躍
評分##太長瞭。看過之後也動不瞭手。不適閤自學，還是當字典吧
評分##算法導論的原版。大美利堅cs專業學生人手一冊
評分##對麵試來說幫助很少
評分##07, 08年買的第二版, 後來又入瞭第三版, 終於慢慢讀明白瞭. 隻要主義真, 鐵杵磨成針....
評分##太長瞭。看過之後也動不瞭手。不適閤自學，還是當字典吧
評分##讀瞭個大概
相關圖書
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2026 book.tinynews.org All Rights Reserved. 静思书屋 版权所有