|
||||||||||||||||||||
|
||||||||||||||||||||
|
||||||||||||||||||||
Algorithms in C++ Part 5
und über 1 Million weitere Bücher verfügbar für Amazon Kindle .
Erfahren Sie mehr
| ||||||||||||||||||||||||
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 Robert Sedgewick auf Amazon
› Besuchen Sie die Seite von Robert Sedgewick auf Amazon
Produktbeschreibungen
Amazon.com
Algorithms in C is a comprehensive repository of algorithms, complete with code. If you're in a pinch and need to code something up fast, this book is the place to look. Starting with basic data structures, Algorithms in C covers an enormous scope of information, with extensive treatment of searching and advanced data structures, sorting, string processing, computational geometry, graph problems, and mathematical algorithms. Although the manual often neglects to provide rigorous analysis, the text surrounding the algorithms provides clear and relevant insight into why the algorithms work.
-- Dieser Text bezieht sich auf eine vergriffene oder nicht verfügbare Ausgabe dieses Titels.
Kurzbeschreibung
Graph algorithms are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest in Robert Sedgewick's classic series on algorithms, this is the field's definitive guide to graph algorithms for C++. Far more than a "revision," this is a thorough rewriting, five times as long as the previous edition, with a new text design, innovative new figures, more detailed descriptions, and many new exercises -- all designed to dramatically enhance the book's value to developers, students, and researchers alike. The book contains six chapters covering graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks -- each with diagrams, sample code, and detailed descriptions intended to help readers understand the basic properties of as broad a range of fundamental graph algorithms as possible. The basic properties of these algorithms are developed from first principles; discussion of advanced mathematical concepts is brief, general, and descriptive, but proofs are rigorous and many open problems are discussed. Sedgewick focuses on practical applications, giving readers all the information and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he covers. (Also available: Algorithms in C++: Parts 1-4, Third Edition, ISBN: 0-201-35088-2).
Welche anderen Artikel kaufen Kunden, nachdem sie diesen Artikel angesehen haben?
In diesem Buch
(Mehr dazu)
Nach einer anderen Ausgabe dieses Buches suchen.
Nach einer anderen Ausgabe dieses Buches suchen.
Ausgewählte Seiten ansehen
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis | Rückseite
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis | Rückseite
Tags(Was ist das?)Bei einem Tag handelt es sich um ein Schlagwort, das zum Produkt passt.
Tags erleichtern allen Kunden die Suche und die Sortierung ihrer Lieblingsprodukte. |
Kundenrezensionen
Die hilfreichsten Kundenrezensionen
2 von 2 Kunden fanden die folgende Rezension hilfreich
Format:Gebundene Ausgabe
I first read Sedgewick's Algorithms many years ago for a programming class in college. I was impressed at the time by it's clear presentation and thorough handling of the most fundamental data structures and algorithms. Queues, hash tables, various flavors of trees and graphs... it's all explained quite well in the text. The orginal edition had code examples in Pascal, and when I lost that copy, I decided to get the 'C++' version. The content is basically identical -- which is not necessarily a bad thing. Those looking for modern object-oriented code examples, however, will be dissapointed. Only the most minimal effort has been made to go from the original Pascal listings. It is really a matter of expectations. The code is not the most readable (many single letter variable names), but the true value of this book is the text, not the code.
2 von 2 Kunden fanden die folgende Rezension hilfreich
Format:Gebundene Ausgabe
The code examples in this book require cryptography to interpret - the idea of meaningful variable names is not something that the author subscribes to. I would not recommend this book to anyone starting out programming because it reinforces bad code layout, and doesn't show what can be done by using sensible variable names to help write self-documenting code. More experienced programmers would probably rather read pseudocode anyway... Algorithms in C is significantly less useful than the earlier Algorithms book by the same author.
2 von 2 Kunden fanden die folgende Rezension hilfreich
Format:Gebundene Ausgabe
For being one of the top computer gurus, this person sure writes some ugly code. Many if not most of the code samples are broken. Also he uses cryptic variable names (a, b, c, x...) and bad coding form in general (most variables are global). This would be fine if this was not a text for Learning algorithms. (looks like the example code was run through a Fortran to Pascal to C converter) On the other hand, I found many of the illustrations very helpful in figuring out what he was trying to say with text. If this book was not required for my class I would not have bought it. I found Numerical Recipes in C to be more useful.
Möchten Sie weitere Rezensionen zu diesem Artikel anzeigen?
Waren diese Rezensionen hilfreich?
Wir wollen von Ihnen hören.
Die neuesten Kundenrezensionen
If you want algorithms, you want this book
The code isn't very easy to read (the only downfall), but it is efficient, and that's what I want.. Take the book Introduction to Algorithms, take out the math, squish it and you... Lesen Sie weiter...
Veröffentlicht am 22. März 2000 von Jack L
Decent but I know a much better book.
I have read this book and found that most of the code examples are useless. Don't think I am one of those people who want code and not theory, I just think it helps to have a... Lesen Sie weiter...
Veröffentlicht am 21. März 2000 von Jonathan Ullman
Very intuitive, but code examples could be clearer
The algorithm descriptions are, for the most part, reasonably easy to follow. The diagrams help to give you a very intuitive "feel" of how each algorithm works, and how... Lesen Sie weiter...
Veröffentlicht am 27. Januar 2000 von Chris Gurnee
Code is translated from Pascal
Bob once admitted that almost all the code is translated from Pascal. He does not have time to write the same code for various editions of his books and uses translator software...
Am 20. Oktober 1999 veröffentlicht
Not a word on C++, It shouldn't be named this way
I wasn't looking for a book on algorithms in C (I already have several of them), I was looking for C++ phylosophy and advantages applied to algorithms. It was very disapointing.
Veröffentlicht am 15. Oktober 1999 von Samuel Ventura (ventura@sanluis.podernet.com.mx)
A struggle to read...
I agree strongly with the previous reviewer, I found this book very difficult to read and wonder who it would be suitable for. Lesen Sie weiter...
Veröffentlicht am 7. Oktober 1999 von Stephen Moore
Why do people like this book?
It is strange to me why some people love this book so much. Admittedly, Sedgewick is very respected in his field and knows a lot about sorting algorithms, but his book is still... Lesen Sie weiter...
Am 3. Juni 1999 veröffentlicht
Covers a lot but poor example and bad coding practice.
This book covers a wide variety of algorithms, ranging form basic sorting and searching to file compression and encryption. Lesen Sie weiter...
Am 22. April 1999 veröffentlicht
could have been better
This book is definitely not suitable for a first course in data structures. However, the coverage of algorithms is excellent and the book is suitable for an intermediate level... Lesen Sie weiter...
Am 9. April 1999 veröffentlicht
Clean and Clear book
The source codes was written in a precise condense way and are intelligible. The content was well arranged.
Am 25. Februar 1999 veröffentlicht
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?
|
