
877-464-8692
Lower Priced Domain Web
|
|
|
|
|
Books : Introduction to Algorithms
|
Amazon.com's Price: $108.19 Prices subject to change.
Availability: Usually ships in 24 hours
This item ships for FREE with Super Saver Shipping.
Binding: Hardcover
Dewey Decimal Number: 005
EAN: 9780072970548
ISBN: 0072970545
Label: McGraw-Hill Science/Engineering/Math
Manufacturer: McGraw-Hill Science/Engineering/Math
Number Of Items: 1
Number Of Pages: 1056
Publication Date: December 16, 2003
Publisher: McGraw-Hill Science/Engineering/Math
Studio: McGraw-Hill Science/Engineering/Math
Sales Rank: 7219
Related Items:
Editorial Review:
Product Description: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects.
In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage.
As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds.
Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.
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.
Average Rating: 
Rating: -
This text is widely considered the leading reference on algorithms in the field of computer science. It was the text that was used in my algorithms course when I was an undergrad computer science student at Wisconsin, and it was one of the only books I held on to because its contents are timeless. The text covers a wide breadth and depth of topics related to the design and implementation of complex algorithms. I found this book very useful for both theoretical projects I did in complexity theory ... Read More
Rating: -
this book was kept up...no pages missing
was a great deal for me, it beats buyin the book for full price
Rating: -
I received the book in a fairly good amount of time. I will just note that this book did not come with it's companion CD. I expected it to have it's companion cd. There was not mention as to whether or not the book had it's companion cd.
Rating: -
I used this book for a graduate level Algorithms course, and I really liked it. It is packed full of content on a wide range of topics. While this book does provide some high-level implementations of algorithms in pseudo-code, you will not find any examples of how to program algorithms in this book. That's really not what this book is meant for anyways.
I found the reading to be easier than Knuth on similar topics, but you still need to have sufficient mathematical background in order ... Read More
Rating: -
There are three versions of the second edition, only one of which has the CD:
The first one is published by the MIT Press, with the title "Introduction to Algorithms". This one has no CD. This is the one Amazon currently carries, so if you buy from Amazon, you get no CD.
The second one is published by McGraw-Hill, also with the title "Introduction to Algorithms". This one also has no CD.
The third one is published by McGraw-Hill too, but has the title "Introduction ... Read More
Browse for similar items by category:
|
|