|
||||||||||||||||||||
|
||||||||||||||||||||
|
||||||||||||||||||||
The Algorithm Design Manual
und über 1 Million weitere Bücher verfügbar für Amazon Kindle .
Erfahren Sie mehr
| ||||||||||||||||||||
 Gutschein erhalten
Tauschen Sie jetzt The Algorithm Design Manual gegen einen Amazon-Gutschein in Höhe von EUR 10,10 ein - einlösbar für Tausende von Artikeln bei Amazon.de. Entdecken Sie mehr eintauschbare Bücher im Bücher Trade-In Shop. Bitte beachten Sie die Teilnahmebedingungen.
 Jetzt für Amazon Student anmelden und um 20% erhöhten Eintauschwert sichern. |
Wird oft zusammen gekauft
Produktinformation
Möchten Sie die Produktinformationen aktualisieren oder Feedback zu den Produktabbildungen geben?
Ist der Verkauf dieses Produkts für Sie nicht akzeptabel? |
Mehr über den Autor
Entdecken Sie Bücher, lesen Sie über Autoren und mehr
› Besuchen Sie die Seite von Steve Skiena auf Amazon
› Besuchen Sie die Seite von Steve Skiena auf Amazon
Produktbeschreibungen
Pressestimmen
From the reviews of the second edition: "...the book is an algorithm implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations, an extensive bibliography … make the book an invaluable resource for everyone interested in the subject." (ACM Computing Reviews) "My absolute favorite for this kind of interview preparation is Steven Skiena’s The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace … graph problems are -- they should be part of every working programmer’s toolkit. The book also covers basic data structures and sorting algorithms, which is a nice bonus. … every 1 – pager has a simple picture, making it easy to remember. This is a great way to learn how to identify hundreds of problem types." (Steve Yegge, Steve Yegge’s Blog, March, 2008) "For a decade, Steven Skiena’s Algorithm Design Manual retained its title as the best and most comprehensive practical algorithm guide to help identify and solve problems. It is now available in an improved second edition that is worth buying simply for the updates. … Every programmer should read this book, and anyone working in the field should keep it close to hand. … Would I recommend it? Absolutely. This is the best investment … a programmer or aspiring programmer can make." (Harold Thimbleby, Times Higher Education, November, 2008) "Addressing the main difficulties of solving problems, this book goes far beyond the design of algorithms. It is essential for scientists, engineers, and any professionals who aim to solve problems, with a noticeable emphasis on real problems. It will not only serve as a valuable undergraduate textbook, but it will also become an irreplaceable reference guide for most professionals in the area." (Carlos Linares Lopez, Computing Reviews, February, 2009) "Skiena focuses on the practical aspects of algorithm design and use. … this work fills an important gap in the knowledge of CS practitioners and students. … this book is suitable as a text for an undergraduate algorithms class, but also as an invaluable reference for the practicing programmer. … This second edition has updated the bibliography to include recent works, making it an extensive bibliography. The index is also thorough and very useful for finding specific problems." (William Fahle, ACM Computing Reviews, December, 2008) “Algorithms are the very heart of computing … . This book is about right for most people. … Each of the topics is treated in a readable informal style with lots of asides and accounts of personal experiences - ‘war stories’ in implementing algorithms. … If you want to use it as a course textbook then there are lots of exercises at the end of every chapter. Highly recommended.” (Mike James, I Programmer, September, 2009) “The Algorithm Design Manual by Steven Skiena is aimed at two groups of people: students and professionals. … It is written in an informal style that I found pleasant and engaging. … The book’s unique structure makes it more likely to be immediately useful to the practitioner who has problem to solve and wants to quickly make progress … . the book succeeds admirably. … would be helpful to the student who has never seen this material before. … Overall, I recommend this book warmly.” (Neelakantan Kartha, The Book Review Column, 2011)
Kurzbeschreibung
This expanded and updated second edition of a classic bestseller continues to take the "mystery" out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new "war stories" and "interview problems", relating experiences from real-world applications. Written by a well-known, IEEE Computer Science teaching-award winner, this new edition is an essential learning tool for students needing a solid grounding in algorithms, as well as a uniquely comprehensive text/reference for professionals.
Welche anderen Artikel kaufen Kunden, nachdem sie diesen Artikel angesehen haben?
In diesem Buch
(Mehr dazu)
Ausgewählte Seiten ansehen
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis | Rückseite
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis | Rückseite
Vorgeschlagene Tags zu ähnlichen Produkten(Was ist das?)Setzen Sie den ersten relevanten Tag hinzu (ein Schlüsselwort, das mit diesem Produkt in engem Zusammenhang steht).
|
Kundenrezensionen
Die hilfreichsten Kundenrezensionen
0 von 1 Kunden fanden die folgende Rezension hilfreich
Format:Taschenbuch
A really great book for understanding algorithms without getting lost in the analysis. Covers a great deal of different problems and contains many, many pointers to software resources. The best part are the one-pagers about certain algorithms at the end.
2 von 5 Kunden fanden die folgende Rezension hilfreich
Format:Gebundene Ausgabe
Ich bin quasi neu in der "Optimierer Szene". Das ist erst mein drittes Buch über Optimierung. So please take my review with a grain of salt.
Mein spezifisches Optimierungsproblem ist ein "Integer/Combinatorial Otimization" Problem. So NP vollständig wie ein Problem nur sein kann und leider auch keiner der Klassiker aus der akademischen Literatur (kein TSP, kein echtes VRP, kein shortest Path, kein Knapsack...). oder wenigsten seh ich es so (was nicht viel aussagt.....leider). Also bin/war ich auf der Suche nach einem Buch, das es einem eine Einführung in das Design von Algos bietet. Obwohl das Buch weniger über Heurismen und Meta-Heurismen handelt, wie ich es mir erhofft habe, war es doch ein echter Glückstreffer, der mir bestimmt cnoch tolle Dienste leisten wird. Der I Teil des Buches behandelt das genereölle Design von Algos, Teil II ist ein Katalog/eine Klassifizierung von Problemen.
Das Buch deckt also recht viele Themenbereiche ab (einfach mal einen Blick ins Inhaltsverzeichnis werfen). Kurz und knapp, dafür aber sehr übersichtlich, prägnant und gut verständlich. Kein Formelmarathon und trotzdem, so finde ich, mit genügend Tiefe. Die "War Stories" sind unterhaltsam aber auch lehrreich. Auf der Home Page des Autors gibts code und interessante links.
Ich finds Klasse!
Mein spezifisches Optimierungsproblem ist ein "Integer/Combinatorial Otimization" Problem. So NP vollständig wie ein Problem nur sein kann und leider auch keiner der Klassiker aus der akademischen Literatur (kein TSP, kein echtes VRP, kein shortest Path, kein Knapsack...). oder wenigsten seh ich es so (was nicht viel aussagt.....leider). Also bin/war ich auf der Suche nach einem Buch, das es einem eine Einführung in das Design von Algos bietet. Obwohl das Buch weniger über Heurismen und Meta-Heurismen handelt, wie ich es mir erhofft habe, war es doch ein echter Glückstreffer, der mir bestimmt cnoch tolle Dienste leisten wird. Der I Teil des Buches behandelt das genereölle Design von Algos, Teil II ist ein Katalog/eine Klassifizierung von Problemen.
Das Buch deckt also recht viele Themenbereiche ab (einfach mal einen Blick ins Inhaltsverzeichnis werfen). Kurz und knapp, dafür aber sehr übersichtlich, prägnant und gut verständlich. Kein Formelmarathon und trotzdem, so finde ich, mit genügend Tiefe. Die "War Stories" sind unterhaltsam aber auch lehrreich. Auf der Home Page des Autors gibts code und interessante links.
Ich finds Klasse!
Die hilfreichsten Kundenrezensionen auf Amazon.com (beta)
Amazon.com:
27 Rezensionen
39 von 45 Kunden fanden die folgende Rezension hilfreich
Could be called "The Joy of Algorithms"
31. Dezember 2009
Format:Gebundene Ausgabe|Von Amazon bestätigter Kauf
My Dad loved to cook and one of his favorite cookbooks was "The Joy of Cooking." By the time he died, the pages of his copy were stained and dusted with flour from being constantly used in his kitchen.
Why did he like it so much? Because not only did it have great recipes, it also explored the basic ingredients and methods and told interesting stories about cooking.
That's why "The Algorithm Design Manual" could be called "The Joy of Algorithms." Not only has it become my "goto" book for finding the right algorithmic approach to a problem, it is a joy to read with Skiena's "war stories" and his lively writing style.
Just like my Dad's "The Joy of Cooking" was never far from his stove, "The Algorithm Design Manual" will never be far from my computer.
Why did he like it so much? Because not only did it have great recipes, it also explored the basic ingredients and methods and told interesting stories about cooking.
That's why "The Algorithm Design Manual" could be called "The Joy of Algorithms." Not only has it become my "goto" book for finding the right algorithmic approach to a problem, it is a joy to read with Skiena's "war stories" and his lively writing style.
Just like my Dad's "The Joy of Cooking" was never far from his stove, "The Algorithm Design Manual" will never be far from my computer.
15 von 17 Kunden fanden die folgende Rezension hilfreich
Great book. Maybe a beginner book, but not for comp sci novices!
3. Oktober 2010
Format:Kindle Edition|Von Amazon bestätigter Kauf
I've got the Cormen book as well, which I love. This book is a much more readable text, by far. I think that others here have broken down the areas covered quite well; so I'll just give a stream of consciousness version of what I liked about the book.
It gives the subject matter with from a need to know standpoint. It also gives you real world examples of how the author has had to utilize algorithms not just to implement a particular solution, but to also optimize existing solutions. Although it doesn't give the hardcore theoretical breakdowns in Cormen's text, don't think that the subject matter is presented in a lightweight format. You will still be given some level of mathematical proof for some algorithms and data structure optimizations.
Although less terse than the typical text on Algorithms, it doesn't try too hard to be cute and quirky. The humor is well placed and not too overbearing.
Though less academic than "Introduction To Algorithms", this ain't the book to pickup to learn about coding algorithms for a quick study prior to an interview. However, if you're planning to get ready for interviews maybe a few months down the road...go for it!
A caveat...I got the Kindle version for the Android, which is none too forgiving when it comes to images. So diagrams look horrible on the phone (even with the DroidX's big-assed screen). It looks fine on the laptop, however.
Enjoy!
It gives the subject matter with from a need to know standpoint. It also gives you real world examples of how the author has had to utilize algorithms not just to implement a particular solution, but to also optimize existing solutions. Although it doesn't give the hardcore theoretical breakdowns in Cormen's text, don't think that the subject matter is presented in a lightweight format. You will still be given some level of mathematical proof for some algorithms and data structure optimizations.
Although less terse than the typical text on Algorithms, it doesn't try too hard to be cute and quirky. The humor is well placed and not too overbearing.
Though less academic than "Introduction To Algorithms", this ain't the book to pickup to learn about coding algorithms for a quick study prior to an interview. However, if you're planning to get ready for interviews maybe a few months down the road...go for it!
A caveat...I got the Kindle version for the Android, which is none too forgiving when it comes to images. So diagrams look horrible on the phone (even with the DroidX's big-assed screen). It looks fine on the laptop, however.
Enjoy!
6 von 6 Kunden fanden die folgende Rezension hilfreich
Good material - Index sucks
7. April 2011
Format:Taschenbuch|Von Amazon bestätigter Kauf
I recently bought the second edition in order to do some personal research and, as such, did not plan on reading the book from cover-to-cover. I intend to use the book as a reference and therefore utilize mainly the index and, to a lesser extent, the table of contents. Yes the material is this book is, in general, sufficient, but the index is bogus. The following presents some examples in order to valid my claim (again, I am referring to the second edition and I am NOT making any claims against the first edition):
(1) Splines --> p. 294 --> Intro to numerical problems with no reference to splines.
(2) Lisp --> p. 409 --> Section on (un)constrained optimisation - no Lisp.
(3) Linked lists -->
(3a) only mentioned in terms of linked lists vs arrays. Correct on p. 368
(3b) p. 72 --> Section stacks/queues or dictionaries. It should refer to pg. 70
My only other complaint (so far) is rather minor and came about while reading the first chapter. In particular, section 1.3.4 on Induction and recursion where the author attempts to use induction in order to prove some function Increment(y). Technically the author is using strong induction and not mathematical induction.
These are just some of the examples of how Springer and their talented editorial staff goofed up, not a representative picture meant to portray the book as an overall failure. As mentioned previously, I would highly recommend this book provided you can get over a faulty index and are not overly pedantic when it comes to someone elses use of Mathematical terminology.
(1) Splines --> p. 294 --> Intro to numerical problems with no reference to splines.
(2) Lisp --> p. 409 --> Section on (un)constrained optimisation - no Lisp.
(3) Linked lists -->
(3a) only mentioned in terms of linked lists vs arrays. Correct on p. 368
(3b) p. 72 --> Section stacks/queues or dictionaries. It should refer to pg. 70
My only other complaint (so far) is rather minor and came about while reading the first chapter. In particular, section 1.3.4 on Induction and recursion where the author attempts to use induction in order to prove some function Increment(y). Technically the author is using strong induction and not mathematical induction.
These are just some of the examples of how Springer and their talented editorial staff goofed up, not a representative picture meant to portray the book as an overall failure. As mentioned previously, I would highly recommend this book provided you can get over a faulty index and are not overly pedantic when it comes to someone elses use of Mathematical terminology.
Waren diese Rezensionen hilfreich?
Wir wollen von Ihnen hören.
Kunden diskutieren
|
Das Forum zu diesem Produkt
Fragen stellen, Meinungen austauschen, Einblicke gewinnen Aktive Diskussionen in ähnlichen Foren
Kundendiskussionen durchsuchen
|
Ähnliche Foren
|
||||||||||||||||||||||||||||||||||
Lieblingslisten
|
|
Ähnliche Artikel finden
Anhand des Sachgebietes nach ähnlichen Produkten suchen:
Ihr Kommentar
Möchten Sie die Produktinformationen aktualisieren oder Feedback zu den Produktabbildungen geben?
|
