| Author: |
|
Thomas H. Cormen
|
| Title: |
 |
Introduction to Algorithms (MIT Electrical Engineering and Computer Science) |
| Moochable copies: |
|
No copies available |
| Amazon suggests: |
|
| Recommended: |
|
| Topics: |
|
| Published in: |
|
English |
| Binding: |
|
Hardcover |
| Pages: |
|
1048 |
| Date: |
|
1990-06-18 |
| ISBN: |
|
0262031418 |
| Publisher: |
|
The MIT Press |
| Weight: |
|
4.9 pounds |
| Size: |
|
8.5 x 2.0 x 10.5 inches |
| Edition: |
|
0 |
Amazon prices: |
|
|
| Previous givers: |
|
3 Bill Lakenan (USA: MD), Spike McLarty (USA: WA), eerock (USA: CA) |
| Previous moochers: |
|
3 Joey (USA: PA), Mike (USA: MA), Jacob Kaplan-Moss (USA: KS) |
| Wishlists: |
|
|
| Description: |
|
Product Description
The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers. This edition is no longer available. Please see the Second Edition of this title.
Amazon.com Review
If you had to buy just one text on algorithms, Introduction to Algorithms is a magnificent choice. The book begins by considering the mathematical foundations of the analysis of algorithms and maintains this mathematical rigor throughout the work. The tools developed in these opening sections are then applied to sorting, data structures, graphs, and a variety of selected algorithms including computational geometry, string algorithms, parallel models of computation, fast Fourier transforms (FFTs), and more.
This book's strength lies in its encyclopedic range, clear exposition, and powerful analysis. Pseudo-code explanation of the algorithms coupled with proof of their accuracy makes this book is a great resource on the basic tools used to analyze the performance of algorithms.
|
| URL: |
|
http://bookmooch.com/0262031418 |
|
|
