Algorithms in C++ Part 5: Graph Algorithms (3rd Edition) und über 1,5 Millionen weitere Bücher verfügbar für Amazon Kindle. Erfahren Sie mehr

Jetzt eintauschen
und EUR 0,10 Gutschein erhalten
Eintausch
Möchten Sie verkaufen? Hier verkaufen
Der Artikel ist in folgender Variante leider nicht verfügbar
Keine Abbildung vorhanden für
Farbe:
Keine Abbildung vorhanden

 
Beginnen Sie mit dem Lesen von Algorithms in C++ Part 5 auf Ihrem Kindle in weniger als einer Minute.

Sie haben keinen Kindle? Hier kaufen oder eine gratis Kindle Lese-App herunterladen.

Algorithims in C (Addison-Wesley Series in Computer Science) [Englisch] [Gebundene Ausgabe]

Robert Sedgewick
3.4 von 5 Sternen  Alle Rezensionen anzeigen (23 Kundenrezensionen)

Erhältlich bei diesen Anbietern.


Weitere Ausgaben

Amazon-Preis Neu ab Gebraucht ab
Kindle Edition EUR 20,90  
Gebundene Ausgabe EUR 47,20  
Gebundene Ausgabe, Januar 1990 --  
Taschenbuch EUR 40,90  

Kurzbeschreibung

Januar 1990 Addison-Wesley Series in Computer Science
This new version of the best-selling book, Algorithms, SecondEdition, provides a comprehensive collection of algorithmsimplemented in C. A variety of algorithms are described in eachofthe following areas: sorting, searching, string-processing,geometric, graph, and mathematical algorithms. These algorithmsare expressed in terms of concise implementations in C, so thatreaders can both appreciate their fundamental properties and testthem on real applications. The treatment of analysis of algorithms is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are preferred, and in some cases, therelationship of the practical algorithms being disussed to purelytheoretical results is also described. Features *Hundreds of detailed, innovative figures clearly demonstratehow important algorithms work. *Throughout the book, "properties" sections encapsulatespecific information on the performance characteristics ofalgorithms. *Six chapters present fundamental concepts, including a briefintroduction to data structures. Algorithms in C provides readers with the tools to confidentlyimplement, run, and debug useful algorithms. This book may beuseful for self-study, or as a reference for people engaged inthe development of computer systems for applications programs. 0201514257B04062001

Kunden, die diesen Artikel angesehen haben, haben auch angesehen


Produktinformation

  • Gebundene Ausgabe: 657 Seiten
  • Verlag: Addison Wesley; Auflage: Ill (Januar 1990)
  • Sprache: Englisch
  • ISBN-10: 0201514257
  • ISBN-13: 978-0201514254
  • Größe und/oder Gewicht: 3 x 16,5 x 23,8 cm
  • Durchschnittliche Kundenbewertung: 3.4 von 5 Sternen  Alle Rezensionen anzeigen (23 Kundenrezensionen)
  • Amazon Bestseller-Rang: Nr. 375.724 in Fremdsprachige Bücher (Siehe Top 100 in Fremdsprachige Bücher)
  • Komplettes Inhaltsverzeichnis ansehen

Mehr über den Autor

Entdecken Sie Bücher, lesen Sie über Autoren und mehr

Produktbeschreibungen

Amazon.de

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.

Synopsis

This new version of the best-selling book, Algorithms, SecondEdition, provides a comprehensive collection of algorithmsimplemented in C. A variety of algorithms are described in eachofthe following areas: sorting, searching, string-processing,geometric, graph, and mathematical algorithms. These algorithmsare expressed in terms of concise implementations in C, so thatreaders can both appreciate their fundamental properties and testthem on real applications. The treatment of analysis of algorithms is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are preferred, and in some cases, therelationship of the practical algorithms being disussed to purelytheoretical results is also described. Features *Hundreds of detailed, innovative figures clearly demonstratehow important algorithms work. *Throughout the book, "properties" sections encapsulatespecific information on the performance characteristics ofalgorithms. *Six chapters present fundamental concepts, including a briefintroduction to data structures. Algorithms in C provides readers with the tools to confidentlyimplement, run, and debug useful algorithms.

This book may beuseful for self-study, or as a reference for people engaged inthe development of computer systems for applications programs. 0201514257B04062001


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
Hier reinlesen und suchen:

Kundenrezensionen

Die hilfreichsten Kundenrezensionen
2 von 2 Kunden fanden die folgende Rezension hilfreich
Von "molly24"
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.
War diese Rezension für Sie hilfreich?
2 von 2 Kunden fanden die folgende Rezension hilfreich
2.0 von 5 Sternen Ugly and Obtusely written examples and text. 25. Februar 1999
Von Ein Kunde
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.
War diese Rezension für Sie hilfreich?
2 von 2 Kunden fanden die folgende Rezension hilfreich
1.0 von 5 Sternen the worst code examples ever seen 1. Juni 2000
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.
War diese Rezension für Sie hilfreich?
1.0 von 5 Sternen Why do people like this book? 3. Juni 1999
Von Ein Kunde
Format:Gebundene Ausgabe
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 dissapointing and very frustrating to read for a beginning computer science student. He seldom includes complete code in his examples, and where there is code, there are sometimes errors in the code.
This reviewer took Sedgewick's class at Princeton University where this book was the required text, and not only was the text poor, his lectures were terribly boring. He himself even recognized that there were errors in his book, and so he allowed his students and TA's to submit errors found in the book. At the end of the year, the list of references to mistakes in the book took up more than three pages.
This review is not the result of a student upset about his grade (an A is fine with me), but is rather an attempt to warn students about the potential pitfalls that may be encountered in reading Sedgewick's book. I suppose this could be a great book for an intermediate or advanced CS student who doesn't mind the sparse and sometimes erroneous code or the terse language used to describe fairly complex ideas. Also, there are some parts of the book that are well written and a pleasure to read. However, I would never recomend this book to anyone interested in learning algorithms for this first time without a fair amount of prior programming experience.
War diese Rezension für Sie hilfreich?
3.0 von 5 Sternen could have been better 9. April 1999
Von Ein Kunde
Format:Gebundene Ausgabe
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 programmer. There is one major problem with the book: no complete source code examples. The better books on programming on the market today include fully worked out source code examples (usually on disk or available through the internet). This book only includes snippets of code, intended to illustrate key aspects of the algorithms. I wanted to work with some of the algorithms later in the book and found myself having to keep paging through earlier sections of the book to figure out what the data structures were supposed to look like. There was no centralized location from which I could pull this information, and in some cases the types/classes/routines were not available at all, and had to be inferred from the information that was present. Given the complexity of the C++ language when it comes to specifying data structures, this is a major flaw. Further, the lack of compilable code with well defined test cases makes it harder for the reader to verify there are no errors in the code samples that ARE provided.
War diese Rezension für Sie hilfreich?
4.0 von 5 Sternen Very intuitive, but code examples could be clearer 27. Januar 2000
Format:Gebundene Ausgabe
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 each compares to other similar algorithms. This is, without doubt, my favorite aspect of this book. Another thing I like is that it didn't read like your standard textbook; it was much less formal, which I found a refreshing change (I read it in college). On the minus side, the code was pretty much C plus classes. Switching from C to C++ really didn't add any value. The author chose to write the code to be as small and concise as reasonable in order to convey the structure of the algorithm in question. I think that he went too far towards this goal; the variable names are are far too short, leading to confusion in complicated algorithms, and very few in-line comments are used.
Bottom line: while it certainly is not a model of how to write well-designed C++, it accomplishes its goal very well: describing, comparing, and contrasting basic to intermediate frequently used algorithms in a very intuitive way.
War diese Rezension für Sie hilfreich?
Möchten Sie weitere Rezensionen zu diesem Artikel anzeigen?
Waren diese Rezensionen hilfreich?   Wir wollen von Ihnen hören.
Die neuesten Kundenrezensionen
5.0 von 5 Sternen 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
1.0 von 5 Sternen 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
3.0 von 5 Sternen 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
1.0 von 5 Sternen 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)
1.0 von 5 Sternen 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
3.0 von 5 Sternen 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
5.0 von 5 Sternen 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
Kundenrezensionen suchen
Nur in den Rezensionen zu diesem Produkt suchen

Kunden diskutieren

Das Forum zu diesem Produkt
Diskussion Antworten Jüngster Beitrag
Noch keine Diskussionen

Fragen stellen, Meinungen austauschen, Einblicke gewinnen
Neue Diskussion starten
Thema:
Erster Beitrag:
Eingabe des Log-ins
 

Kundendiskussionen durchsuchen
Alle Amazon-Diskussionen durchsuchen
   


Ähnliche Artikel finden


Ihr Kommentar