Enjoy fast, FREE delivery, exclusive deals and award-winning movies & TV shows with Prime
Try Prime
and start saving today with Fast, FREE Delivery
Amazon Prime includes:
Fast, FREE Delivery is available to Prime members. To join, select "Try Amazon Prime and start saving today with Fast, FREE Delivery" below the Add to Cart button.
Amazon Prime members enjoy:- Cardmembers earn 5% Back at Amazon.com with a Prime Credit Card.
- Unlimited Free Two-Day Delivery
- Instant streaming of thousands of movies and TV episodes with Prime Video
- A Kindle book to borrow for free each month - with no due dates
- Listen to over 2 million songs and hundreds of playlists
- Unlimited photo storage with anywhere access
Important: Your credit card will NOT be charged when you start your free trial or if you cancel during the trial period. If you're happy with Amazon Prime, do nothing. At the end of the free trial, your membership will automatically upgrade to a monthly membership.
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required. Learn more
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Algorithms in C, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms 3rd Edition
-
90 days FREE Amazon Music. Terms apply.
90 days FREE of Amazon Music Unlimited. Offer included with purchase. Only for new subscribers who have not received offer in last 90 days. Renews automatically. You will receive an email to redeem. Terms apply. Offered by Amazon.com. Here's how (restrictions apply)
Purchase options and add-ons
Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C, Third Edition, Parts 1-4 and his new Algorithms in C, Third Edition, Part 5. Together, these books are definitive: the most up-to-date and practical algorithms resource available. Sedgewick masterfully blends theory and practice, making Bundle of Algorithms in C, Third Edition an essential resource for computer science researchers, students, and working developers alike. The first book introduces fundamental concepts associated with algorithms; then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Together, these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs. In both books, Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents.
- ISBN-100201756080
- ISBN-13978-0201756081
- Edition3rd
- PublisherAddison-Wesley Professional
- Publication dateAugust 31, 2001
- LanguageEnglish
- Dimensions9.4 x 7.8 x 2.4 inches
- Print length1200 pages
Frequently bought together

What do customers buy after viewing this item?
- Most purchased | Highest rated | Lowest Pricein this set of products
Cracking the Coding Interview: 189 Programming Questions and SolutionsPaperback
Special offers and product promotions
- 90 days FREE of Amazon Music Unlimited. Offer included with purchase. Only for new subscribers who have not received offer in last 90 days. Renews automatically. You will receive an email to redeem. Terms apply. Offered by Amazon.com. Here's how (restrictions apply)
Editorial Reviews
From the Back Cover
Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms for C. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C, Third Edition, Parts 1-4 and his new Algorithms in C, Third Edition, Part 5, at a special discounted price. Together, these books are the most definitive, up-to-date, and practical algorithms resource available. The first book introduces fundamental concepts associated with algorithms, then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents. Together these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs.
0201756080B07112001
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.
0201756080AB06262002
Product details
- Publisher : Addison-Wesley Professional; 3rd edition (August 31, 2001)
- Language : English
- Paperback : 1200 pages
- ISBN-10 : 0201756080
- ISBN-13 : 978-0201756081
- Item Weight : 4.76 pounds
- Dimensions : 9.4 x 7.8 x 2.4 inches
- Best Sellers Rank: #1,158,442 in Books (See Top 100 in Books)
- #105 in Computer Programming Structured Design
- #213 in C Programming Language
- #448 in Computer Systems Analysis & Design (Books)
- 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 Amazon-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
Cormen is an introduction to a lot of different types of algorithms.
Skiena presents a practical guide on applying algorithms.
Sedgewick is about very clean, easy to understand + memorize implementations of standard algorithms. I think the implementations in this book are some of the most beautiful and terse programs around. One thing that's initially a bit off putting is the sheer number of words that accompany each example, but I've found that the very in depth explanations are actually quite good ... after you've had some time to sit and play with the examples first. If you're willing to put in the effort, the text is actually really quite accessible. You do have to attack each example for a while before you start to feel like you're on the same wavelength as the author, but only because the material itself requires it, not because the text is difficult to understand.
Top reviews from other countries
However, Part 1-4 was printed before 2000 and Part 5 was printed in 2002. The paper is thin and the print is old-fashioned. I am not sure if such books are worth over 100€. Should the books never be updated with newer editions, this 3rd edition is only worth it for the breadth of the algorithms included, not for the reader's experience with the paperback.












