EUR 83,41
  • Tous les prix incluent la TVA.
Il ne reste plus que 9 exemplaire(s) en stock (d'autres exemplaires sont en cours d'acheminement).
Expédié et vendu par Amazon. Emballage cadeau disponible.
Algorithms a été ajouté à votre Panier
Vous l'avez déjà ?
Repliez vers l'arrière Repliez vers l'avant
Ecoutez Lecture en cours... Interrompu   Vous écoutez un extrait de l'édition audio Audible
En savoir plus
Voir les 3 images

Algorithms (Anglais) Relié – 9 mars 2011

4.5 étoiles sur 5 2 commentaires client

Voir les 2 formats et éditions Masquer les autres formats et éditions
Prix Amazon
Neuf à partir de Occasion à partir de
Format Kindle
"Veuillez réessayer"
Relié
"Veuillez réessayer"
EUR 83,41
EUR 77,35 EUR 81,85
Note: Cet article est éligible à la livraison en points de collecte. Détails
Récupérer votre colis où vous voulez quand vous voulez.
  • Choisissez parmi 17 000 points de collecte en France
  • Les membres du programme Amazon Prime bénéficient de livraison gratuites illimitées
Comment commander vers un point de collecte ?
  1. Trouvez votre point de collecte et ajoutez-le à votre carnet d’adresses
  2. Sélectionnez cette adresse lors de votre commande
Plus d’informations

rentrée scolaire 2017 rentrée scolaire 2017

click to open popover

Offres spéciales et liens associés


Produits fréquemment achetés ensemble

  • Algorithms
  • +
  • Cracking the Coding Interview, 6th Edition: 189 Programming Questions and Solutions
  • +
  • Elements of Programming Interviews: The Insiders' Guide
Prix total: EUR 143,09
Acheter les articles sélectionnés ensemble

Description du produit

Présentation de l'éditeur

This fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing -- including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.

The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts.

The companion web site, algs4.cs.princeton.edu contains

  • An online synopsis
  • Full Java implementations
  • Test data
  • Exercises and answers
  • Dynamic visualizations
  • Lecture slides
  • Programming assignments with checklists
  • Links to related material

    The MOOC related to this book is accessible via the "Online Course" link at algs4.cs.princeton.edu. The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants.

    Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience.

  • Biographie de l'auteur

    Robert Sedgewick has been a Professor of Computer Science at Princeton University since 1985, where he was the founding Chairman of the Department of Computer Science. He has held visiting research positions at Xerox PARC, Institute for Defense Analyses, and INRIA, and is member of the board of directors of Adobe Systems. Professor Sedgewick’s research interests include analytic combinatorics, design and analysis of data structures and algorithms, and program visualization. His landmark book, Algorithms, now in its fourth edition, has appeared in numerous versions and languages over the past thirty years. In addition, with Kevin Wayne, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).

     

    Kevin Wayne is the Phillip Y. Goldman Senior Lecturer in Computer Science at Princeton University, where he has been teaching since 1998. He received a Ph.D. in operations research and industrial engineering from Cornell University. His research interests include the design, analysis, and implementation of algorithms, especially for graphs and discrete optimization. With Robert Sedgewick, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).

    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 numéro de téléphone mobile.



    Détails sur le produit


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

    Commentaires en ligne

    4.5 étoiles sur 5
    5 étoiles
    1
    4 étoiles
    1
    3 étoiles
    0
    2 étoiles
    0
    1 étoile
    0
    Voir les deux commentaires client
    Partagez votre opinion avec les autres clients

    Meilleurs commentaires des clients

    Format: Relié Achat vérifié
    Cet ouvrage m'a été très utile pour réviser mes entretiens. Il m'a permis d'apprendre et approfondir certaines approches algorithmiques très répandues.

    Il présente l'avantage de décrire des implémentations en commençant par une version basique de celles-ci puis les complexifie pour arriver à des solutions plus exploitables d'un point de vue complexité. Les trade-offs mis en jeu par chacune des optimisations sont commentées et justifiées. L'usage des algorithmes présentés sur des problèmes de la vie réelle est aussi relativement intéressant. Une palette importante d'algorithmes est couverte.
    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
    Format: Relié Achat vérifié
    Il s'agit d'un ouvrage de référence, très complet. Il couvre de à peu près tous les sujets liés à l'algorithmique, propose des exercies pour entrer dans les détails.

    Je regrette jusqte qu'il soit moins drôle à lire que les ouvrages de la collection _Head fist on_ te que les exercices ne soient pas corrigés (il y a parfois des indications)
    1 commentaire 3 personnes ont trouvé cela utile. 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) (Peut contenir des commentaires issus du programme Early Reviewer Rewards)

    Amazon.com: 4.5 étoiles sur 5 213 commentaires
    11 internautes sur 11 ont trouvé ce commentaire utile 
    5.0 étoiles sur 5 Wonderful Book on Algorithms 19 novembre 2015
    Par fengshuienthu - Publié sur Amazon.com
    Format: Relié Achat vérifié
    Well written and well organized covers all of the important algorithms. I have Robert Sedgewick's two prior books Algorithms in C. This book is much easier to understand and present much simpler manner. I bought this as way of preparing for interviews and it is helping me a lot. At the end of the day It is not hard to impress Google. Amazon and FB engineers at interviews when you are well prepared.
    11 internautes sur 12 ont trouvé ce commentaire utile 
    5.0 étoiles sur 5 Must-have volume for any student of computer science 20 novembre 2014
    Par Der Jens - Publié sur Amazon.com
    Format: Relié Achat vérifié
    The book is about algorithms and data structures in Java, and not about learning to program. My review will contrast this book with Sedgewick's 25+year old "Algorithms in C++" in my shelf. The new algorithms book is such a vast improvement over the old C++ book that I hardly recognize it any more. The new Algorithms has two authors. The authors are using a sub-set of the Java OO features (unlike the C++ version, which used none). While I may not agree in detail with some choices, I can understand, because they explained their coding standards well, and why they limit features. The algorithms are updated to the basic algorithms a student these days needs to have heard of, which includes new material like tries. I was fascinated to see a regular expression evaluation automaton in code, with explanations. Some more esoteric material from the C++ book (for instance, Voronoi diagrams) is left for specialized books. At a few places in the book, the impact of algorithms and data structures is illustrated giving real-world examples. And I have yet to read chapter 6.
    But what really impressed me was the code. This book shows the fundamental data structures and algorithms in just a few lines of beautiful and well-thought code. Sure, any nit-picker may find quibbles, but most choices are understandable from a didactic and printing perspective. This code is so much better than any in the old C++ book. The authors preferred clarity, yet the code is still concise. The authors are clear about feature creep, and limit their code to what is needed and no more, though some extensions are part of the exercises. I am reminded of the Einstein paraphrase "As simple as possible, but no simpler".
    More complex data structures and algorithms need multiple code boxes, which are all explained in detail, with the box appearing close to the explanation. Some readers may take issue with the density of information in examples, but I find it advantageous to have all information close-by rather than spread out. I prefer to pore over their dense examples than having to flip pages.
    5 internautes sur 5 ont trouvé ce commentaire utile 
    5.0 étoiles sur 5 Broad, Approachable, Well-supported 31 octobre 2015
    Par Monday Monkey - Publié sur Amazon.com
    Format: Relié Achat vérifié
    Excellent book. Approachable, well-organized and also supported by a top notch website and course on Coursera.

    If you're new to the study of algorithms, the trio of this book, its website, and the Coursera course are a potent combination for successful learning.

    This is a more approachable alternative to the CLRS algorithms book.
    2 internautes sur 2 ont trouvé ce commentaire utile 
    4.0 étoiles sur 5 Pretty good. 4 mai 2016
    Par J. Baylor - Publié sur Amazon.com
    Format: Relié Achat vérifié
    It has an excellent helper website that allows you to download most of the example code from the book and a few java helper classes to make reading and writing to files, stdout, and stdin quick and easy. It has a few helper classes like the run-time stopwatch all available for downloading.

    Some of the explanations and code examples were a little overly complicated- Sorting was explained using a 15-20 letter phase instead of starting with a single word to make it easier to digest and them moving on to the more complex example. On most topics our prof explained the algorithms a little differently than the book and his way was easier to comprehend.
    4 internautes sur 4 ont trouvé ce commentaire utile 
    5.0 étoiles sur 5 MUST HAVE resource for all in IT field 11 juillet 2015
    Par C. J. Clavadetscher - Publié sur Amazon.com
    Format: Relié Achat vérifié
    A superb review of "all" of the relevant structures that programmers really need to know. Supplemental resources dramatically expand the overall value of a most valuable text. "Must have" for working professionals in the IT field, and the same for undergraduate students in IT related fields.
    Ces commentaires ont-ils été utiles ? Dites-le-nous