Introduction to Algorithms 2nd edition
ISBN: 0262032937
Category: Technical
Tag: Science/Engineering
<< Buy This Book on Amazon >>
697 views since 2007-06-13, updated at 2009-09-04.
Description
www.AvaxHome.ru
Book Description:
Aimed at any serious programmer or computer science student, the new second edition of Introduction to Algorithms builds on the tradition of the original with a truly magisterial guide to the world of algorithms. Clearly presented, mathematically rigorous, and yet approachable even for the math-averse, this title sets a high standard for a textbook and reference to the best algorithms for solving a wide range of computing problems.
With sample problems and mathematical proofs demonstrating the correctness of each algorithm, this book is ideal as a textbook for classroom study, but its reach doesn't end there. The authors do a fine job of explaining each algorithm. (Reference sections on basic mathematical notation will help readers bridge the gap, but it will help to have some math background to appreciate the full achievement of this handsome hardcover volume.) Every algorithm is presented in pseudo-code, which can be implemented in any computer language, including C/C++ and Java. This ecumenical approach is one of the book's strengths. When it comes to sorting and common data structures, from basic linked lists to trees (including binary trees, red-black, and B-trees), this title really shines, with clear diagrams that show algorithms in operation. Even if you just glance over the mathematical notation here, you can definitely benefit from this text in other ways.
The book moves forward with more advanced algorithms that implement strategies for solving more complicated problems (including dynamic programming techniques, greedy algorithms, and amortized analysis). Algorithms for graphing problems (used in such real-world business problems as optimizing flight schedules or flow through pipelines) come next. In each case, the authors provide the best from current research in each topic, along with sample solutions.
This text closes with a grab bag of useful algorithms including matrix operations and linear programming, evaluating polynomials, and the well-known Fast Fourier Transformation (FFT) (useful in signal processing and engineering). Final sections on "NP-complete" problems, like the well-known traveling salesman problem, show off that while not all problems have a demonstrably final and best answer, algorithms that generate acceptable approximate solutions can still be used to generate useful, real-world answers.
Throughout this text, the authors anchor their discussion of algorithms with current examples drawn from molecular biology (like the Human Genome Project), business, and engineering. Each section ends with short discussions of related historical material, often discussing original research in each area of algorithms. On the whole, they argue successfully that algorithms are a "technology" just like hardware and software that can be used to write better software that does more, with better performance. Along with classic books on algorithms (like Donald Knuth's three-volume set, The Art of Computer Programming), this title sets a new standard for compiling the best research in algorithms. For any experienced developer, regardless of their chosen language, this text deserves a close look for extending the range and performance of real-world software.
Book Info:
Published in 2005
Published by MIT Press
Author Thomas H. Cormen
ISBN 0262032937 Size 17.90MB
Alternative Link:
Link2
Download this book from Usenet
Free register and download UseNet downloader, then you can free download from UseNet.Free Download "Introduction to Algorithms 2nd edition" from Usenet!
Buy this book from amazon
Disclaimer:
Contents of this page are indexed from the Internet. All actions are under your responsability. Email us to report illegal contents or external links and we'll remove them immediately.
Search More...
Introduction to Algorithms 2nd editionLinks
Free Trade Magazine Subscriptions & Technical Document DownloadsSearch and Buy
<< Search and Buy This Book on Amazon >>
Download this book from Usenet
How to download:Free register to download UseNet downloader and install, then search book title and start downloading. You can DOWNLOAD 150GB for free! Register and Download NOW!
Free Download "Introduction to Algorithms 2nd edition" from Usenet!
Download Link 2
Download links for "Introduction to Algorithms 2nd edition":
How to Download
You may need eMule or Bittorrent to download ebook torrents or emule links.
Report Dead Link
Please leave a comment to report dead links, so that someone else may update new links.
External Download Link1:
How to Download
You may need eMule or Bittorrent to download ebook torrents or emule links.
Report Dead Link
Please leave a comment to report dead links, so that someone else may update new links.
Related Books
Books related to "Introduction to Algorithms 2nd edition":
- Ebooks list page : 671
- Introduction to Algorithms 2nd Edition
- Introduction to Algorithms, Second Edition
- Introduction to Algorithms, 2nd Edition
- Introduction to Algorithms, Second Edition
- Introduction to Algorithms, Second Edition
- Introduction to Algorithms, Second Edition
- Introduction to Algorithms, Second Edition
- [share_ebook] MIT.Introduction.to.Algorithms.Second.Edition.chm
- Introduction to the Design and Analysis of Algorithms, 2nd Edition
- An Introduction to Parallel Computing: Design and Analysis of Algorithms, Second Edition
- Thomas H. Cormen, Charles E. Leiserson - Introduction to Algorithms, Second Edition (Repost)
- Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3rd Edition
- Introduction to Algorithms, Second Edition
- [share_ebook] Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3rd Edition
- Introduction to Algorithms, Second Edition
Comments
Comments for "Introduction to Algorithms 2nd edition":
Add Your Comments
- Download links and password may be in the description section, read description carefully!
- Do a search to find mirrors if no download links or dead links.



