Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Follow the author
OK
Algorithms in C Combined
- ISBN-100201849372
- ISBN-13978-0201849370
- EditionSubsequent
- PublisherAddison-Wesley
- Publication dateJune 15, 2002
- LanguageEnglish
Customers who viewed this item also viewed
- Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, SearchingPaperbackFREE Shipping by AmazonGet it as soon as Monday, Oct 5
- Introduction to Algorithms, fourth editionHardcoverFREE Shipping by AmazonGet it as soon as Monday, Oct 5Only 12 left in stock (more on the way).
- Algorithms (4th Edition)HardcoverFREE Shipping by AmazonGet it as soon as Sunday, Oct 11Usually ships within 5 to 7 days
- Grokking Algorithms, Second Edition: An illustrated guide for programmers and other curious peoplePaperbackFREE Shipping by AmazonGet it as soon as Monday, Oct 5
- Algorithms in C, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Bundle)PaperbackFREE Shipping by AmazonGet it as soon as Monday, Oct 5Only 7 left in stock - order soon.
Product details
- Publisher : Addison-Wesley
- Publication date : June 15, 2002
- Edition : Subsequent
- Language : English
- ISBN-10 : 0201849372
- ISBN-13 : 978-0201849370
- Item Weight : 1.74 pounds
- Best Sellers Rank: #320 in C Programming Language
- #4,633 in Computer Programming Languages
- Customer Reviews:
About the author

Robert Sedgewick (born December 20, 1946) is a computer science professor at Princeton University and a member of the board of directors of Adobe Systems.
Sedgewick completed his Ph.D. in 1975 under the supervision of Donald Knuth at Stanford. His thesis was about the quicksort algorithm. In 1975–85 he served on the faculty of Brown University.
Sedgewick was the founding Chairman (1985) of the Department of Computer Science at Princeton University and is currently still a Professor of Computer Science at Princeton. He was a visiting researcher at Xerox PARC, Institute for Defense Analyses and INRIA.
In 1997 Robert Sedgewick was inducted as a Fellow of the Association for Computing Machinery for his seminal work in the mathematical analysis of algorithms and pioneering research in algorithm animation.
Robert Sedgewick is the author of a well-known book series Algorithms, published by Addison-Wesley. The first edition of the book was published in 1983 and contained code in Pascal. Subsequent editions used C, C++, Modula-3, and Java.
With Philippe Flajolet he wrote several books and preprints which promoted analytic combinatorics, a discipline which relies on the use of generating functions and complex analysis in order to enumerate combinatorial structures, and to study their asymptotic properties. As explained by Knuth in The Art of Computer Programming, this is the key to perform average case analysis of algorithms.
He teaches four open online courses on the online learning platform Coursera, namely Algorithms Part I and Part II, Analysis of Algorithms and Analytic Combinatorics.
Bio from Wikipedia, the free encyclopedia.
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on AmazonTop reviews from the United States
- 5 out of 5 stars
Incredibly useful book
Reviewed in the United States on November 6, 2024I've used many of these algorithms over the years, so when my son started taking C in college I got him the same book that I've found so useful.
Sending feedback...Sending feedback...HelpfulThank you for your feedback.Sorry, we failed to record your vote. Please try againThanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport - 5 out of 5 stars
Just as I remembered
Reviewed in the United States on October 30, 2011My advisor gave me a copy of this book as a graduation present in 1990, in Pascal. I thought I still had it, so when I find I needed the C version for a graduate class (this has since been upgraded to Algorithms in C++) I decided to sve beaucoup bucks in getting a used version. And the book is just as I remember, just in C. Here's hoping the C++ version is just as clear!
I would highly recommend this book for anyone wanting to either learn or review basic algorithms in an undergraduate or graduate class, or in the workplace. It helped me write several parsers when I needed them!
2 people found this helpfulSending feedback...Sending feedback...HelpfulThank you for your feedback.Sorry, we failed to record your vote. Please try againThanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport - 5 out of 5 stars
Algorithms done the old school way (aka right way)
Reviewed in the United States on October 16, 2018This is the perfect book for a reader who wants the core logic and fundamental data structures needed to implement some of the popular algorithms.
This is perhaps a little dated but if you are looking for algorithms and are C/C++ programmer, then this is the book. If you're looking for a well refined shiny API to re-use a library of these algorithms, then this won't be useful to you.
If you need to build something from scratch and need to learn how to fuse one of these algorithms natively into your system then this book will help.
3 people found this helpfulSending feedback...Sending feedback...HelpfulThank you for your feedback.Sorry, we failed to record your vote. Please try againThanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport - 5 out of 5 stars
Still a good read!
Reviewed in the United States on August 31, 2018It is the classic of data structures and algorithms. ANSI 1989 ‘C’ is used for the example code. Nice hardcover. Sturdy. Comprehensive. Relevant.
One person found this helpfulSending feedback...Sending feedback...HelpfulThank you for your feedback.Sorry, we failed to record your vote. Please try againThanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport - 1 out of 5 stars
the worst code examples ever seen
Reviewed in the United States on June 1, 2000The 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.
7 people found this helpfulSending feedback...Sending feedback...HelpfulThank you for your feedback.Sorry, we failed to record your vote. Please try againThanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport - 5 out of 5 stars
Description matched received goods.
Reviewed in the United States on August 27, 2018I got the quality product I was expecting based on the vendors description.
Sending feedback...Sending feedback...HelpfulThank you for your feedback.Sorry, we failed to record your vote. Please try againThanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport - 3 out of 5 stars
Terse
Reviewed in the United States on October 12, 2010It's quite terse and needs many more COMPLETE diagrams for better visualization of difficult concepts. Fill-in-the-details sort of diagrams don't quite cut it for understanding complicated algorithms. The explanation of code isn't that verbose, so you might have to read the same sentence three or more times to understand its meaning.
2 people found this helpfulSending feedback...Sending feedback...HelpfulThank you for your feedback.Sorry, we failed to record your vote. Please try againThanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport - 5 out of 5 stars
Five Stars
Reviewed in the United States on May 10, 2016Great book!! Best c book out there
2 people found this helpfulSending feedback...Sending feedback...HelpfulThank you for your feedback.Sorry, we failed to record your vote. Please try againThanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport
Top reviews from other countries
Amazon Customer5 out of 5 starsすごく良い
Reviewed in Japan on December 6, 2021すごく良い。思ったより。
Very good. Better than expected.
Sending feedback...Thanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport
Aman Vaishya1 out of 5 starsOne Star
Reviewed in India on August 15, 2017Received wrong book
Sending feedback...Thanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport
JollyJackson3 out of 5 starsDecent book on algorithms with examples in C++
Reviewed in the United Kingdom on October 20, 2016Good book, used it for class.
Use the thesaurus because there are a lot of mistakes in the code examples and elsewhere.
Sending feedback...Thanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport
Former student1 out of 5 starsThe book's content is organized in a bad way I think
Reviewed in the United Kingdom on November 18, 2014The book's content is organized in a bad way I think. The C++ code is horrible and is written in a bad and error prone way. The implementation of the data structures and algorithms is terrible. Sedgewick clearly didn't know C++ and the book was clearly published as a new version of the "Algorithms in C" book because C++ was hot at the time - a quick way to bank some bucks. I see no reason to use C++ to illustrate algorithms - use C, it's simpler and has less overhead for the reader.
Sending feedback...Thanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport








