| ||||||||||||||||||||||||
 Trade In this Item for up to £21.50
Get an extra £5 when you trade in books worth £10 or more until June 30, 2012. Trade in Introduction to Algorithms for an Amazon.co.uk gift card of up to £21.50, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Find more products eligible for trade-in.
|
Frequently Bought Together
Product details
|
More About the Authors
Discover books, learn about writers, and more.
Product Description
Review
"As an educator and researcher in the field of algorithms for over two decades, I can unequivocally say that the Cormen et al book is the best textbook that I have ever seen on this subject. It offers an incisive, encyclopedic, and modern treatment of algorithms, and our department will continue to use it for teaching at both the graduate and undergraduate levels, as well as a reliable research reference."--Gabriel Robins, Department of Computer Science, University of Virginia "Introduction to Algorithms, the 'bible' of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomial-time algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance."--Daniel Spielman, Department of Computer Science, Yale University -- Daniel Spielman " Introduction to Algorithms, the "bible" of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomial-time algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance." Daniel Spielman , Department of Computer Science, Yale University
Product Description
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, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. 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.
Inside This Book
(Learn More)
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
What Other Items Do Customers Buy After Viewing This Item?
Customer Reviews
Most Helpful Customer Reviews
7 of 8 people found the following review helpful
Format:Paperback
De facto text book for Algorithms
Who need this book
Programmer who want to optimize their algorithms or just want to brush up different algorithms which they use in their day to day programming.
Student who are learning Computer science at university, this book is must have for them.
Book is divided in following main sections
1.Foundations
This section has 5 chapters and gives the basic idea about the algorithms and how to solve a problem using an algorithm and different approach about the algorithms.
Explain about the notation of algorithms and how to write a one.
Explain how to calculate the complexity of algorithms and along with the different notations such as big o etc.
2.Sorting and Order Statistics
This section is devoted to different sorting algorithms such as quick and heap etc, there are 4 chapters in total.
3.Data Structures
This section gives basic idea about the data structure before advance section; this section includes stack, link list, queue, hash table etc.
There are 5 chapters in total for basic data structures.
4.Advanced design and analysis technique
This section has 3 chapters and explains dynamic programming, greedy algorithms and amortized analysis.
5.Advance Data Structures
This section explains about B tree, Fibonacci heap, van Emde Boas tree and disjoint set.
6.Graph algorithms
This section explains about different graph algorithms such dijkstra and shortest path algorithms etc.
7.Selected topics
this section has some different topics such as multithreaded algorithms, matrix operation , string matching and pattern matching etc.
Point about book.
Book is well written and very concise.
Explain every algorithm in very details.
Most of the algorithms are covered in book along with the calculating the complexity of algorithms.
Doesn't follow any specific computer programming language syntax for algorithms so it's easy to follow for non-programmer.
Every chapters has some problem set at the end of the chapter and in between (answers are not provided in book but some solutions are there on book's website.)
There are lots of diagram in book for better explanation.
Most advance topics, those are not suitable for under graduate are marked with Star.
Book required some basic engineering mathematical understanding.
Who need this book
Programmer who want to optimize their algorithms or just want to brush up different algorithms which they use in their day to day programming.
Student who are learning Computer science at university, this book is must have for them.
Book is divided in following main sections
1.Foundations
This section has 5 chapters and gives the basic idea about the algorithms and how to solve a problem using an algorithm and different approach about the algorithms.
Explain about the notation of algorithms and how to write a one.
Explain how to calculate the complexity of algorithms and along with the different notations such as big o etc.
2.Sorting and Order Statistics
This section is devoted to different sorting algorithms such as quick and heap etc, there are 4 chapters in total.
3.Data Structures
This section gives basic idea about the data structure before advance section; this section includes stack, link list, queue, hash table etc.
There are 5 chapters in total for basic data structures.
4.Advanced design and analysis technique
This section has 3 chapters and explains dynamic programming, greedy algorithms and amortized analysis.
5.Advance Data Structures
This section explains about B tree, Fibonacci heap, van Emde Boas tree and disjoint set.
6.Graph algorithms
This section explains about different graph algorithms such dijkstra and shortest path algorithms etc.
7.Selected topics
this section has some different topics such as multithreaded algorithms, matrix operation , string matching and pattern matching etc.
Point about book.
Book is well written and very concise.
Explain every algorithm in very details.
Most of the algorithms are covered in book along with the calculating the complexity of algorithms.
Doesn't follow any specific computer programming language syntax for algorithms so it's easy to follow for non-programmer.
Every chapters has some problem set at the end of the chapter and in between (answers are not provided in book but some solutions are there on book's website.)
There are lots of diagram in book for better explanation.
Most advance topics, those are not suitable for under graduate are marked with Star.
Book required some basic engineering mathematical understanding.
7 of 9 people found the following review helpful
Format:Kindle Edition|Amazon Verified Purchase
This book may have good content - I don't know because is too irritating to read !
this is because the publisher has been too lazy to produce a proper kindle version.
Very annoying at nearly £30 !
I use iPad 3 for all my reading in landscape mode - does not work well with this photocopy version
Constant panning and scanning and enlarging very tedious especially because reader lacks a default zoom option therefore needs constant resetting.
Amazes me how the publishers even those in IT have been so slow and poor at adapting to this new paradigm.
They are stupidly loosing a fortune. I would have bought many expensive books if available for kindle. I no longer buy heavy inconvenient printed technical books.
this is because the publisher has been too lazy to produce a proper kindle version.
Very annoying at nearly £30 !
I use iPad 3 for all my reading in landscape mode - does not work well with this photocopy version
Constant panning and scanning and enlarging very tedious especially because reader lacks a default zoom option therefore needs constant resetting.
Amazes me how the publishers even those in IT have been so slow and poor at adapting to this new paradigm.
They are stupidly loosing a fortune. I would have bought many expensive books if available for kindle. I no longer buy heavy inconvenient printed technical books.
14 of 22 people found the following review helpful
Format:Paperback
This book is brilliant. I bought this to read from cover to cover, so that I could get a 'head-start' before going to university on a Computer Science course. This is perfect as it contains everything you need and more! In addition the book is great as a reference book - if you forgot about Van Emde Boas Trees then you can remind yourself by reading the appropriate chapter. A Must Have For Every Computer Scientist.
Would you like to see more reviews about this item?
Were these reviews helpful?
Let us know
Most Recent Customer Reviews
The book on the subject
Covers the subject for advanced, undergraduate and graduate public. good value for the money spent. Clear language and easy to follow.
Published 6 months ago by Payam
From a newbie
I work like software professional and I think you need to know how things works in essence although you never have to program an algorithm in your day-to-day job. Read more
Published 8 months ago by Jesús Navarrete
Holy Bible
It's a real holy bible for you, if you occupation is related to computer science
Published 20 months ago by Avanesov
A must have book on data structures and algorithms.
This is a book must have book. All Computer Science student and professional must have read it.
Published 20 months ago by Gabriel Reis
Book Short Review
Great Book, with very accessible language to explain the methods and algorithms. One of the best books i read.
Published on 12 Jan 2010 by P. Cancelo
Nice book.
This is a very nice book. If you are gonna buy a book about algorithms this is the book you are looking for. Read more
Published on 30 Sep 2009 by K. G. Hagen
Listmania!
|
|
Look for similar items by category
Look for similar items by subject
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
|
