Algorithms in C++ Part 5: Graph Algorithms (3rd Edition) and over 2 million other books are available for Amazon Kindle . Learn more

Buy Used
Used - Very Good See details
Price: £6.19

or
 
   
Trade in Yours
For a £0.64 Gift Card
Trade in
Have one to sell? Sell yours here
Sorry, this item is not available in
Image not available for
Colour:
Image not available

 
Start reading Algorithms in C++ Part 5 on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Algorithims in C (Addison-Wesley Series in Computer Science) [Hardcover]

Robert Sedgewick
3.8 out of 5 stars  See all reviews (14 customer reviews)

Available from these sellers.


Formats

Amazon Price New from Used from
Kindle Edition £30.89  
Hardcover --  
Paperback £34.99  
Trade In this Item for up to £0.64
Trade in Algorithims in C (Addison-Wesley Series in Computer Science) for an Amazon Gift Card of up to £0.64, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Learn more

Book Description

1 Jan 1990 0201514257 978-0201514254 1
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


Product details

  • Hardcover: 672 pages
  • Publisher: Addison Wesley; 1 edition (1 Jan 1990)
  • Language: English
  • ISBN-10: 0201514257
  • ISBN-13: 978-0201514254
  • Product Dimensions: 24.2 x 16.7 x 3 cm
  • Average Customer Review: 3.8 out of 5 stars  See all reviews (14 customer reviews)
  • Amazon Bestsellers Rank: 1,384,919 in Books (See Top 100 in Books)
  • See Complete Table of Contents

More About the Author

Discover books, learn about writers, and more.

Product Description

From the Back Cover

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

About the Author

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.



0201514257AB06262002


Inside This Book (Learn More)
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

What Other Items Do Customers Buy After Viewing This Item?


Customer Reviews

Most Helpful Customer Reviews
2 of 2 people found the following review helpful
3.0 out of 5 stars could have been better 9 April 1999
By A Customer
Format:Hardcover
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.
Comment | 
Was this review helpful to you?
3 of 3 people found the following review helpful
4.0 out of 5 stars Great text, but weak examples 4 Sep 1998
By A Customer
Format:Hardcover
This book covers the standard algorithms for searching, sorting, and some math, geometry, and graphing in a readable format. There is also some fun stuff including a brief section on the RSA cryptosystem. The code examples are very skimpy, leaving implementation to the reader, but the concepts are explained very well. Without doubt, a recommendation for intermediate programmers exploring these algorithms for the first or second time and for self-teaching.
Comment | 
Was this review helpful to you?
1 of 1 people found the following review helpful
5.0 out of 5 stars Very Helpful 18 Jan 1999
By A Customer
Format:Hardcover
This book provides information on a wide variety of algorithms, from basic searching and sorting, to more advanced, mathematical material. While it does not go into as much depth as other texts, all ideas are explained in a clear and very readable manner. I highly recommend this book for any intermediate level programmer looking to gain a better perspective on a wide variety of algorithms.
Comment | 
Was this review helpful to you?
By A Customer
Format:Hardcover
Finally a book that just cuts to the chase and gives you the building blocks for basic and advanced data structures and methods. The chapters are well written so that you won't feel too tired after reading one, and the code is pretty concise and readable. The book begins with elementary algorithms and data structures that should be under every programmer's belt before moving on to the good stuff: hash tables, graphs, n log(n) sorting algorithms, Red-Black trees, and really cool heap array implementations. If that wasn't enough for you, the book moves on to upper level undergrad type algorithms that will be useful in the future. I thought the chapter on Hash Tables was well written and easy to implement. Also, the chapter on Graphs was easy to understand with their pictures of various "trees" or "forests" that could form with nodes. I'd highly recommend reading the hash table chapter with the hash function "hashpjw" from the "Dragon Book."
Comment | 
Was this review helpful to you?
3.0 out of 5 stars Fair to midland 21 Oct 1997
By A Customer
Format:Hardcover
This book was probably pretty good in 1992 but, is terribly outdated now. There is a complete lack of modern data structures and anything close to encapsulation techniques just isn't here. I would recommend a more up to date book. For what it's worth, I have yet to see ANY book written in C that gives in-depth coverage of the most frequently used data structures.
Comment | 
Was this review helpful to you?
8 of 11 people found the following review helpful
1.0 out of 5 stars Why do people like this book? 3 Jun 1999
By A Customer
Format:Hardcover
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.
Comment | 
Was this review helpful to you?
By A Customer
Format:Hardcover
This doesn't do a very good job of presenting data structures that mesh into a well designed C++ program, but it's got great explanations of the algorithms themselves, and if you're a half-decent programmer, you can code up a design yourself quickly from the explanations given.
Comment | 
Was this review helpful to you?
Would you like to see more reviews about this item?
Were these reviews helpful?   Let us know

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 

Search Customer Discussions
Search all Amazon discussions
   


Look for similar items by category


Feedback