Commencez à lire The Algorithm Design Manual sur votre Kindle dans moins d'une minute. Vous n'avez pas encore de Kindle ? Achetez-le ici Ou commencez à lire dès maintenant avec l'une de nos applications de lecture Kindle gratuites.

Envoyer sur votre Kindle ou un autre appareil


Essai gratuit

Découvrez gratuitement un extrait de ce titre

Envoyer sur votre Kindle ou un autre appareil

Désolé, cet article n'est pas disponible en
Image non disponible pour la
couleur :
Image non disponible

The Algorithm Design Manual [Format Kindle]

Steven S Skiena
4.5 étoiles sur 5  Voir tous les commentaires (2 commentaires client)

Prix éditeur - format imprimé : EUR 63,25
Prix Kindle : EUR 44,28 TTC & envoi gratuit via réseau sans fil par Amazon Whispernet
Économisez : EUR 18,97 (30%)

App de lecture Kindle gratuite Tout le monde peut lire les livres Kindle, même sans un appareil Kindle, grâce à l'appli Kindle GRATUITE pour les smartphones, les tablettes et les ordinateurs.

Pour obtenir l'appli gratuite, saisissez votre adresse e-mail ou numéro de téléphone mobile.


Prix Amazon Neuf à partir de Occasion à partir de
Format Kindle EUR 44,28  
Relié EUR 87,68  
Broché EUR 63,25  

Descriptions du produit

Présentation de l'éditeur

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.

Détails sur le produit

En savoir plus sur l'auteur

Découvrez des livres, informez-vous sur les écrivains, lisez des blogs d'auteurs et bien plus encore.

Quels sont les autres articles que les clients achètent après avoir regardé cet article?

Commentaires en ligne

3 étoiles
2 étoiles
1 étoiles
4.5 étoiles sur 5
4.5 étoiles sur 5
Commentaires client les plus utiles
1 internautes sur 1 ont trouvé ce commentaire utile 
5.0 étoiles sur 5 Parfait! 18 mai 2013
Format:Broché|Achat vérifié
Excellent livre, écrit de manière très claire et avec de nombreux exemples réels.
L'organisation des chapitres est très bien faite, on commence doucement avec une présentation des structures de données les plus simple, jusqu'aux algorithmes les plus complexes. La deuxième partie du livre est mine d'or, avec un classement des algorithmes par problème.
Avez-vous trouvé ce commentaire utile ?
4.0 étoiles sur 5 Excellent book for algorithm design 26 février 2012
This book a really good one for improving your skill in algorithm design.
Explaination are clear and efficient!
Exercices help you to apply theroy!
Avez-vous trouvé ce commentaire utile ?
Commentaires client les plus utiles sur (beta) 4.4 étoiles sur 5  88 commentaires
47 internautes sur 49 ont trouvé ce commentaire utile 
4.0 étoiles sur 5 Great book. Maybe a beginner book, but not for comp sci novices! 3 octobre 2010
Par E. Jones - Publié sur
Format:Format Kindle|Achat vérifié
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.

41 internautes sur 46 ont trouvé ce commentaire utile 
3.0 étoiles sur 5 Infusion of knowledge for the non-computer scientist 27 juin 2013
Par Ari Telias - Publié sur
This book was recommended to me by a member of a large company that starts with G and rhymes with noodle...
He explained that it "the best" for learning algorithmns. Being out of university for many years, and being a mechanical/software engineer vs a computer scientist, I needed something to refresh my memory and teach me what I did not know about algorithms.

So the good first:
1. I was able to read (almost, see point 4) the whole book (663 actual pages to read) in 5 nights (at 4-5 hours per night), so it is good if you need the knowledge in a rush.
2. Most of the knowledge is quite comprehensible. Specifically the basic concepts: Big-O notation, logarithmic behaviour, data structures, graph traversal.
3. The second part of the book is more like a reference, so if you have a problem to solve, you can go there and use that to direct you to the appropriate algorithms.
4. I did not read the "war stories", lack of time and lack of interest. Those are where the author tells us his brave battles against the algorithms.

The Bad:
1. Some topics are not explained clear enough: I could NOT understand the important sorts (Quick, Merge, Heap) just by reading the book. I tried as hard as I could, but only when I went to "the net", read it again, and actually coded the things myself + going line by line with the debugeer I finally understood them.
2. The code samples actually make function calls to functions that are not written there. You are left hangin' - what do we do now?
3. Trees: Splay trees, black red trees, AVL trees, B-Trees and tries - they are barely mentioned or given a few words. Not enough, in my humble opinion.
4. Weighted graph problems: Either the topic is for genius level only, or I am an idiot, or the explanation was horrible. Chose any two... Didn't understand anything.

Well, hope I didn't bore you too much. Good luck with your algorithms!


86 internautes sur 101 ont trouvé ce commentaire utile 
5.0 étoiles sur 5 Could be called "The Joy of Algorithms" 31 décembre 2009
Par George H. - Publié sur
Format:Relié|Achat vérifié
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.
47 internautes sur 54 ont trouvé ce commentaire utile 
5.0 étoiles sur 5 Good book 3 octobre 2012
Par Walter E. Gillett - Publié sur
Format:Format Kindle|Achat vérifié
[update - Feb, 2014]

Several other reviewers say that the problems I reported originally with the Kindle edition of this book have been fixed. I no longer own the book (got a refund in 2012), so can't confirm that directly. Changing the review title and upgrading to 5 stars accordingly (I would prefer just to delete the review entirely but that does not appear to be possible).


[original review - Oct, 2012]

It's a good book but I have discovered that key parts of the Kindle edition are garbled, making the book useless. Buy the physical book, not the Kindle edition, don't make my mistake!

For example, take a look at the "ClosestPair(P)" algorithm described on p7 of the hardcover edition, see the preview . Compare that to the same algorithm shown in the Kindle edition: . The indentation is completely messed up and worse yet, there are other mistakes like "if dist(s, t) <= d" becomes "if dist(s, t) = d" (the "<=" changes to just "=") that are completely wrong.
15 internautes sur 17 ont trouvé ce commentaire utile 
5.0 étoiles sur 5 Best Intro To Algorithms 26 octobre 2009
Par Jeremiah LaRocco - Publié sur
Format:Relié|Achat vérifié
I've read through the first half of the book, and am now at the catalog of algorithms that makes up the second half, and I've really enjoyed the book so far.

Most books on algorithms take a very formal, math heavy approach in which they present, analyze and prove things about a somewhat arbitrary collection of algorithms. There's usually no mention of real world applications.

This book, however, takes a different approach, and serves as a guide book for using algorithms in the real world. There's a heavy emphasis on formulating problems in terms of existing, solved problems. If you can "map" your problem to one with a known solution, then you can use the proven, existing solution to solve your problem. To emphasize that point, roughly the entire second half of the book is a catalog of known problems and solutions, with references to software libraries, books and other sources of information.

I also love that the example code is in C. Too many books give example code in languages with a lot of overhead, like Java, and end up obscuring the important parts with a ton of object-oriented crap. Yes - OOP is nice, but unless I'm reading a book on OOP, I don't want to dig through 30 lines of irrelevant boilerplate just to find the 10 lines relevant to the algorithm.

That said, it's not the best code in the world. Some of the snippets could be explained better. And there were a few stylistic issues, such as leaving off function return types and a bunch of global variables, that I didn't like, but I'm willing to forgive those because it's not a book on C, and the lack of syntactic clutter made the algorithm easier to see.

I also thought chapter nine was a bit too long. A good portion of the chapter is spent reducing various NP-complete problems to other NP-complete problems. Interesting, but it was a bit too theoretical, and didn't really fit with the with the rest of the book.
Ces commentaires ont-ils été utiles ?   Dites-le-nous
Rechercher des commentaires
Rechercher uniquement parmi les commentaires portant sur ce produit

Discussions entre clients

Le forum concernant ce produit
Discussion Réponses Message le plus récent
Pas de discussions pour l'instant

Posez des questions, partagez votre opinion, gagnez en compréhension
Démarrer une nouvelle discussion
Première publication:
Aller s'identifier

Rechercher parmi les discussions des clients
Rechercher dans toutes les discussions Amazon

Rechercher des articles similaires par rubrique