| ||||||||||||
 Trade In this Item for up to £17.40
Trade in Algorithm Design: Foundations, Analysis and Internet Examples for an Amazon.co.uk gift card of up to £17.40, which you can then spend on millions of items across the site. Plus, get an extra £5 when you trade in books worth £10 or more until June 30, 2012. Trade-in values may vary (terms apply). Find more products eligible for trade-in.
|
Frequently Bought Together
Product details
|
More About the Author
Product Description
Zentralblatt Math, Vol. 997, No.22, 2002
"..the material is nicely presented..."
Product Description
Michael Goodrich and Roberto Tamassia, authors of the successful, Data Structures and Algorithms in Java, 2/e, have written Algorithm Engineering, a text designed to provide a comprehensive introduction to the design, implementation and analysis of computer algorithms and data structures from a modern perspective. This book offers theoretical analysis techniques as well as algorithmic design patterns and experimental methods for the engineering of algorithms.
Market: Computer Scientists; Programmers.
Market: Computer Scientists; Programmers.
Inside This Book
(Learn More)
First Sentence
In a classic story, the famous mathematician Archimedes was asked to determine if a golden crown commissioned by the king was indeed pure gold, and not part silver, as an informant had claimed. Read the first page
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
In a classic story, the famous mathematician Archimedes was asked to determine if a golden crown commissioned by the king was indeed pure gold, and not part silver, as an informant had claimed. Read the first page
Explore More
Concordance
Browse Sample PagesConcordance
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product)
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
What Other Items Do Customers Buy After Viewing This Item?
Customer Reviews
Most Helpful Customer Reviews
3 of 4 people found the following review helpful
Format:Paperback
In this book, G&T takes a fantastic path in introducing the complex theory of algorithms. It has a very easy start and with only a basic knowledge of JAVA and math you'll to understand the entire text. In contrast to their former book the theory is speedier, i.e. they get around a hole lot of extra subject, but still with the same amount of quality and complexity. A new turn in this edition are the internet parrallels. Since most students are familliar the web, it seems easyier for them to comprehend the "heavy" sections. Thus, all-in-all a book that gets my deepest recommendations.
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:
11 reviews
8 of 8 people found the following review helpful
Good Fundamentals
1 July 2002
Format:Paperback|Amazon Verified Purchase
There are many good books with this title or similar ones. This is probably one of the better ones for your bookshelf and for use in academia. The examples are written in Java (a current language) and they are easy to read. The presentation is clean and illustrative. The authors have a good track record for expertise and papers published, and you get the sense that it is more real-world than most similar books.
3 of 3 people found the following review helpful
Do yourself a favor and dont buy this book
13 Mar 2008
Format:Paperback
Though I am a member of Amazon for years, and purchased many books, this is my first review about a book. It`s 2 am, and I am trying to understand the book`s questions, as a PhD student for hours. I took algorithms course before when I was getting my MS in a different university, where we were using Cormen & Leiserson`s book, I was liking this course and having no problems, I also watched all the MIT OCW`s lectures from Leiserson and the other young professor, and I can say I was totally comfortable with subjects. Algorithm was a course I was liking till I came across with that book.
However, this book became my nightmare with its ambiguities, poorly written sentences, ambiguous questions. I asked TA about some questions, and for every and every question I asked, she said `oh yes, this was not clear for other students too, so we thought this may be ...` And the hard part about questions are understanding the question, not solving it. This incidence happened in a 2nd tier(top 30) US university, in a graduate course.
What can I say? What is the reason and justification to write such a book?
I think, during my life I used over 40 textbooks, this one without doubt is in top 3 in worst text book lists (with Mark Weiss`s Data Structures, and Sedra& Smith`s microelectronics). I am giving two stars because they made at least a website, though I cant say its very helpful, they continue to being ambiguous even in the hints they say.
The book is so dull that, by just inspecting introduction which tells Archimed`s history (which became a cliche even in high school books and irrelevant to the introduction and algorithms in general) you can see this. Then look at Sedgewick`s introduction about an efficient algorithm finding prime numbers, Knuth`s introduction about roots of algorithm word etc...
I recommend Cormen`s or Sedgewick`s books, actually I cant imagine a worse book than that, if I had written something only that can be worser, but I am not claiming I am a good writer/author (as it can be seen from this review). I am sorry for writing such a harsh review, but my advice if you see a course offering this textbook, please refrain for taking the course for your good.
However, this book became my nightmare with its ambiguities, poorly written sentences, ambiguous questions. I asked TA about some questions, and for every and every question I asked, she said `oh yes, this was not clear for other students too, so we thought this may be ...` And the hard part about questions are understanding the question, not solving it. This incidence happened in a 2nd tier(top 30) US university, in a graduate course.
What can I say? What is the reason and justification to write such a book?
I think, during my life I used over 40 textbooks, this one without doubt is in top 3 in worst text book lists (with Mark Weiss`s Data Structures, and Sedra& Smith`s microelectronics). I am giving two stars because they made at least a website, though I cant say its very helpful, they continue to being ambiguous even in the hints they say.
The book is so dull that, by just inspecting introduction which tells Archimed`s history (which became a cliche even in high school books and irrelevant to the introduction and algorithms in general) you can see this. Then look at Sedgewick`s introduction about an efficient algorithm finding prime numbers, Knuth`s introduction about roots of algorithm word etc...
I recommend Cormen`s or Sedgewick`s books, actually I cant imagine a worse book than that, if I had written something only that can be worser, but I am not claiming I am a good writer/author (as it can be seen from this review). I am sorry for writing such a harsh review, but my advice if you see a course offering this textbook, please refrain for taking the course for your good.
2 of 2 people found the following review helpful
DO NOT BUY THIS BOOK
29 Nov 2007
Format:Paperback
It might just be me, but this book is horrible at explaning the topics it covers. If I was you, I'd go to wikipedia before ever going to this book.
Were these reviews helpful?
Let us know
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.
|
