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
Gebraucht kaufen
EUR 5,22
+ EUR 3,00 Versandkosten
Gebraucht: Gut | Details
Verkauft von super-buecher
Zustand: Gebraucht: Gut
Kommentar: Expressversand gegen Aufpreis möglich.
Ihren Artikel jetzt
eintauschen und
EUR 0,10 Gutschein erhalten.
Möchten Sie verkaufen?
Zur Rückseite klappen Zur Vorderseite klappen
Anhören Wird wiedergegeben... Angehalten   Sie hören eine Probe der Audible-Audioausgabe.
Weitere Informationen
Dieses Bild anzeigen

Algorithims in C (Addison-Wesley Series in Computer Science) (Englisch) Gebundene Ausgabe – Januar 1990


Alle 10 Formate und Ausgaben anzeigen Andere Formate und Ausgaben ausblenden
Amazon-Preis Neu ab Gebraucht ab
Kindle Edition
"Bitte wiederholen"
Gebundene Ausgabe, Januar 1990
EUR 62,34 EUR 5,21
5 neu ab EUR 62,34 11 gebraucht ab EUR 5,21

Hinweise und Aktionen

  • Beim Kauf von Produkten ab 40 EUR erhalten Sie eine E-Mail mit einem 10 EUR Gutscheincode, einlösbar auf ausgewählte Premium-Beauty-Produkte. Diese Aktion gilt nur für Produkte mit Verkauf und Versand durch Amazon.de. Für weitere Informationen zur Aktion bitte hier klicken.

  • Sparpaket: 3 Hörbücher für 33 EUR: Entdecken Sie unsere vielseitige Auswahl an reduzierten Hörbüchern und erhalten Sie 3 Hörbücher Ihrer Wahl für 33 EUR. Klicken Sie hier, um direkt zur Aktion zu gelangen.

Jeder kann Kindle Bücher lesen — selbst ohne ein Kindle-Gerät — mit der KOSTENFREIEN Kindle App für Smartphones, Tablets und Computer.


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: 16 x 3 x 24,1 cm
  • Durchschnittliche Kundenbewertung: 3.4 von 5 Sternen  Alle Rezensionen anzeigen (23 Kundenrezensionen)
  • Amazon Bestseller-Rang: Nr. 416.033 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" am 20. Juni 2000
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.
Kommentar War diese Rezension für Sie hilfreich? Ja Nein Feedback senden...
Vielen Dank für Ihr Feedback. Wenn diese Rezension unangemessen ist, informieren Sie uns bitte darüber.
Wir konnten Ihre Stimmabgabe leider nicht speichern. Bitte erneut versuchen
2 von 2 Kunden fanden die folgende Rezension hilfreich Von Ein Kunde am 25. Februar 1999
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.
Kommentar War diese Rezension für Sie hilfreich? Ja Nein Feedback senden...
Vielen Dank für Ihr Feedback. Wenn diese Rezension unangemessen ist, informieren Sie uns bitte darüber.
Wir konnten Ihre Stimmabgabe leider nicht speichern. Bitte erneut versuchen
2 von 2 Kunden fanden die folgende Rezension hilfreich Von "crispin@cs.man.ac.uk" am 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.
Kommentar War diese Rezension für Sie hilfreich? Ja Nein Feedback senden...
Vielen Dank für Ihr Feedback. Wenn diese Rezension unangemessen ist, informieren Sie uns bitte darüber.
Wir konnten Ihre Stimmabgabe leider nicht speichern. Bitte erneut versuchen
Von Ein Kunde am 3. Juni 1999
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.
Kommentar War diese Rezension für Sie hilfreich? Ja Nein Feedback senden...
Vielen Dank für Ihr Feedback. Wenn diese Rezension unangemessen ist, informieren Sie uns bitte darüber.
Wir konnten Ihre Stimmabgabe leider nicht speichern. Bitte erneut versuchen
Von Ein Kunde am 9. April 1999
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.
Kommentar War diese Rezension für Sie hilfreich? Ja Nein Feedback senden...
Vielen Dank für Ihr Feedback. Wenn diese Rezension unangemessen ist, informieren Sie uns bitte darüber.
Wir konnten Ihre Stimmabgabe leider nicht speichern. Bitte erneut versuchen
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.
Kommentar War diese Rezension für Sie hilfreich? Ja Nein Feedback senden...
Vielen Dank für Ihr Feedback. Wenn diese Rezension unangemessen ist, informieren Sie uns bitte darüber.
Wir konnten Ihre Stimmabgabe leider nicht speichern. Bitte erneut versuchen

Die neuesten Kundenrezensionen