Aucun appareil Kindle n'est requis. Téléchargez l'une des applis Kindle gratuites et commencez à lire les livres Kindle sur votre smartphone, tablette ou ordinateur.

  • Apple
  • Android
  • Windows Phone
  • Android

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

Prix Kindle : EUR 31,74

Économisez
EUR 37,59 (54%)

TVA incluse

Ces promotions seront appliquées à cet article :

Certaines promotions sont cumulables avec d'autres offres promotionnelles, d'autres non. Pour en savoir plus, veuillez vous référer aux conditions générales de ces promotions.

Envoyer sur votre Kindle ou un autre appareil

Envoyer sur votre Kindle ou un autre appareil

Repliez vers l'arrière Repliez vers l'avant
Narration Audible Lecture en cours... Interrompu   Vous écoutez un extrait de la narration Audible pour ce livre Kindle.
En savoir plus

Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching Format Kindle

5 étoiles sur 5 1 commentaire client

Voir les formats et éditions Masquer les autres formats et éditions
Prix Amazon
Neuf à partir de Occasion à partir de
Format Kindle
"Veuillez réessayer"
EUR 31,74

Longueur : 756 pages Composition améliorée: Activé Langue : Anglais
  • En raison de la taille importante du fichier, ce livre peut prendre plus de temps à télécharger

Ponts de mai 2016 Promo Ponts de mai 2016


Descriptions du produit

Présentation de l'éditeur

Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications.

Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers!

This particular book, Parts 1n4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations.

Highlights
  • Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures
  • Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions
  • Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations
  • New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more
  • Increased quantitative information about the algorithms, giving you a basis for comparing them
  • Over 1000 new exercises to help you learn the properties of algorithms

Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

Quatrième de couverture

Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications.

Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers!

This particular book, Parts 1n4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations.

Highlights
  • Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures
  • Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions
  • Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations
  • New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more
  • Increased quantitative information about the algorithms, giving you a basis for comparing them
  • Over 1000 new exercises to help you learn the properties of algorithms

Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.


Détails sur le produit

  • Format : Format Kindle
  • Taille du fichier : 10512 KB
  • Nombre de pages de l'édition imprimée : 756 pages
  • Pagination - ISBN de l'édition imprimée de référence : 0201350882
  • Utilisation simultanée de l'appareil : Jusqu'à 5 appareils simultanés, selon les limites de l'éditeur
  • Editeur : Addison-Wesley Professional; Édition : 3 (13 juillet 1998)
  • Vendu par : Amazon Media EU S.à r.l.
  • Langue : Anglais
  • ASIN: B001FWIJFA
  • Synthèse vocale : Activée
  • X-Ray :
  • Word Wise: Non activé
  • Composition améliorée: Activé
  • Moyenne des commentaires client : 5.0 étoiles sur 5 1 commentaire client
  • Classement des meilleures ventes d'Amazon: n°307.791 dans la Boutique Kindle (Voir le Top 100 dans la Boutique Kindle)
  •  Voulez-vous faire un commentaire sur des images ou nous signaler un prix inférieur ?

Commentaires en ligne

5.0 étoiles sur 5
5 étoiles
1
4 étoiles
0
3 étoiles
0
2 étoiles
0
1 étoiles
0
Voir le commentaire client
Partagez votre opinion avec les autres clients

Meilleurs commentaires des clients

Par Un client le 3 décembre 2002
Format: Broché
Un livre d'excellente qualité, qui allie explications théoriques et implémentation.
Remarque sur ce commentaire Avez-vous trouvé ce commentaire utile ? Oui Non Commentaire en cours d'envoi...
Merci pour votre commentaire.
Désolé, nous n'avons pas réussi à enregistrer votre vote. Veuillez réessayer
Signaler un abus

Commentaires client les plus utiles sur Amazon.com (beta)

Amazon.com: HASH(0x95d8e45c) étoiles sur 5 43 commentaires
59 internautes sur 61 ont trouvé ce commentaire utile 
HASH(0x95da1fd8) étoiles sur 5 Excellent, Exhaustive (but not rigorous) 21 octobre 2001
Par Optimistix - Publié sur Amazon.com
Format: Broché
If you're looking for an exhaustive, upto-date reference/textbook for
fundamental, searching and sorting algorithms, then this is one of
the very best available.
Sedgewick has split his popular book into two volumes, with Graph
algorithms being hifted to the second volume. Moreover, many advanced
topics like computational geometry, fft, number theoretic algorithms
etc, which were introduced in the previous edition, seem to be missing
now - so the breadth of coverage seems to have reduced, which is a pity.
However, the depth has increased instead - i doubt that even Knuth
covers more sorting algorithms ! In particular, there are several
recent algorithms and data structures which are treated in greater
detail here than by Knuth. Of course, Knuth analyses all the
algorithms he presents in rigorous and exhaustive detail, which
this book doesn't.
Moreover, the book has many new algorithms and presents the state of the
art in sorting and searching algorithms, giving it a distinct advantage
over the older books.
Sedgewick makes it very clear in the preface that the emphasis is on
the practical importance of the algorithms, so esoteric algorithms which
are important 'only in theory' may find no mention. Also the emphasis is
more on the design of algorithms than on their analysis.
The number of (exercise!!) problems has multiplied manifold in this edition
to become more than most competing textbooks. Problems are graded by
difficulty level to help you choose the ones relevant to your needs.
The exposition is clear and authoritative - Prof. Sedgewick is a leading
authority in the field of algorithms and a student of Donald Knuth.
He has a gift for making difficult concepts seem simple, and the great
illustrations in the book go a long way in explaining the behaviour of
the algorithms.
For the practising professional, this is an ideal reference, since it'll
help you select the best algorithm for your task without bogging you
down with heavy mathematics.
The reasearcher, on the other hand, may benefit by gaining unique insights
from a master of the area, while using other books for the detailed
analysis of algorithms, including prehaps Sedgewick's own book on the
analysis of algorithms(with Flajolet).
A caveat - the code may not be 'ready to run'. It's better not to rely
on this book to provide you with usable code - if that is what you want,
perhaps the books by Drozdek/Weiss/Heileman/Rowe might be better choices.
If you want C code rather than C++, then the C version of this book is
a good choice, since the code provided is of 'K & R' class and therefore
a delight to read.
Of course, if you're looking for a language independent coverage,
then 'Introduction to algorithms' by Cormen,Leiserson and Rivest is
possibly the best book which combines rigor with comprehensive coverage
of the most important algorithms. Look out for the newly released
second edition.
And if you want a more rigorous and equally exhaustive coverage of
sorting and searching, go for Knuth vol.3 - still the authoritative
reference, though it may require more hard work on the reader's part.
Otherwise, invest in this and you won't be disappointed.
61 internautes sur 64 ont trouvé ce commentaire utile 
HASH(0x95da4048) étoiles sur 5 Deceiving after "Algorithms in C" 29 décembre 2000
Par Rubens Altimari - Publié sur Amazon.com
Format: Broché
I can't honestly give less than 3 stars, since this series is one of the best on algorithms I ever had. But, having two editions, including the last one, of "Algorithms in C", by the same author, I thought this C++ version would be a revelation. But it is not! It gives the impression that he just exchanged "printf" for "cout <<"! I thought he would use C++ specific structures to enhance the algorithms (at least that is what I've expected), but it's just another slightly different version of the same book. I wish I knew beforehand... If it's your first book by Sedgewick, though, I guess it's a good option.
32 internautes sur 32 ont trouvé ce commentaire utile 
HASH(0x95da4480) étoiles sur 5 I've read the rest and this one is the best. 4 avril 1999
Par Un client - Publié sur Amazon.com
Format: Broché
Algorithms in C++ Parts 1-4:
After an exhaustive review of nearly every book available on data structures and algorithms (including the seminal "Art of Computer Programming"), and after a considerable reduction in my bank account, I can safely say that this is the best book available on these topics - period.
I rate a book on the basis of how close it comes to being the ONLY book that is needed to completely cover the subject matter. This is actually an almost unattainable goal for an author but this is the test I use. Writing style, clarity of communicating ideas, organization of the material, depth of coverage, practicality, and usability are all crucial elements of that goal and marks a book that will retain its value over time.
This book comes closer to reaching that goal than any other book I've read. I do have a minor complaint about this book and that is the particular coding style that Dr. Sedgewick uses. I am always diligent about writing clear, self-documenting, and visually appealing code whereas Dr. Sedgewick's code is, perhaps from necessity, rather abbreviated. For example, I've always preferred to use meaningful variable names, not just X or Y and am careful to use indentation to improve code readability etc. etc. This is a minor complaint however, and does not affect the usability of the code.
By the way, I do have one other complaint about which I have tried to contact Dr. Sedgewick: WHEN WILL THE SECOND VOLUME BE AVAILABLE!?
19 internautes sur 19 ont trouvé ce commentaire utile 
HASH(0x95da4834) étoiles sur 5 MUCH better than his previous "C++" work... 7 juin 2000
Par Un client - Publié sur Amazon.com
Format: Broché
If at first you don't succeed...
Sedgewick's first cut at "Algorithms in C++" was a sick joke; the code was often incorrect and very difficult for even an intermediate C programmer to follow. In addition, there was virtually no difference between the C and C++ algorithms. In fact, that's why I put C++ in quotes in the title -- calling it representative C++ code was an extreme stretch.
It took several years, but Sedgewick has fixed that and has turned this work into one which better realizes its full potential. There is now a much stronger C++ and OOP flavor to the examples than there was before.
In summary, whereas I feel the previous version is not worth seriously studying (at least not the examples), this one is extremely solid and worth a spot on the bookshelf for CS students and "real-world" C++ programmers alike.
Call it the ballplayer who atones for his previous strike out by hitting a home run in his next time at bat.
5 internautes sur 5 ont trouvé ce commentaire utile 
HASH(0x95da4600) étoiles sur 5 good algorithm book for programmers 25 mars 2001
Par whippedboy99@yahoo.com - Publié sur Amazon.com
Format: Broché
This book delivers what it says on the title and nothing more; Fundamentals, data structures, sorting, and searching. In my opinion, the topics covered in this book are just perfect for beginners. Its not too much and not too little. This book does a very good of explaining the pros and cons of each algorithm, how they're implemented, and when they should be used. As far as Math. goes, this book doesn't deal a whole lot with it. It really is written for programmers.
Ces commentaires ont-ils été utiles ? Dites-le-nous

Discussions entre clients