- Paperback: 720 pages
- Publisher: Addison-Wesley Professional; 3 edition (September 27, 1997)
- Language: English
- ISBN-10: 0201314525
- ISBN-13: 978-0201314526
- Product Dimensions: 7.8 x 1.5 x 9.1 inches
- Shipping Weight: 2.9 pounds (View shipping rates and policies)
- Average Customer Review: 25 customer reviews
- Amazon Best Sellers Rank: #566,588 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching (3rd Edition) (Pts. 1-4) 3rd Edition
Use the Amazon App to scan ISBNs and compare prices.
See the Best Books of 2017
Looking for something great to read? Browse our editors' picks for the best books of the year in fiction, nonfiction, mysteries, children's books, and much more.
Frequently bought together
Customers who bought this item also bought
From the Back Cover
""This is an eminently readable book which an ordinary programmer, unskilled in mathematical analysis and wary of theoretical algorithms, ought to be able to pick up and get a lot out of.."
- Steve Summit, author of "C Programming FAQs "Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive.
- William A. Ward, University of South Alabama" Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The algorithms and data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language.Highlights
- Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures
- Greater emphasis on abstract data types (ADTs) than in previous editions
- Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations
- New implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more
- Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them
- Over 1000 new exercises to help you learn the properties of algorithms
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.
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
I think that it also depends on the person. For me, I prefer to pick up the algorithms through as many as problems and practices, not explanations and analysis. However, I believe that this book is thoughtful enough for those who want be professional in teaching algorithms or talking about algorithms in depth.
The other issue I have is that a lot of the examples use recursion. The author makes the claim that tail-recursion is just as efficient as iterative loops. I agree with this statement when C code is build with maximal optimization (04). When building for debug, tail recursion will still blow up stack space, so all of these recursive functions would still need to be converted to an iterative approach.
The biggest writing style flaw I see in the text is the target audience. One minute I think the audience is a mathematician and the next I am convinced it is a product designer. A great deal of clarity would come from picking a particular target audience so that you don't have to explain everything as you go. (e.g. I already know C, I don't need to read about how pointers work. Put that information in an appendix).
I found this book a very good introduction to algorithms. Of course, as it's a very vast subject, some things were not covered quite as much as some may desire, but this book studies sorting and searching very extensivly, as well as string matching, geometric and mathematical algorithms. It also talks about other subjects such as crytography, data compression, etc, but these are less explained. At any rate, for such subjects as are not fully detailed(in fact, for all subjects), there are references to other books upon the subject.
I think this is a very good book to begin with, because it reaches a compromise between completeness and rigourous mathematical dealing of subjects on the one hand, and readability on the other. It gives explainations about the fundamentals of algorithmics, gives and extensively explains the basic, widely used algorithms, while giving the beginner a view of a wide variety of other subjects, which he can then further investigate if he so desires. After a book such as this, one could very well go onto very advanced algorithmic topics in some very specific field.
And yet, again, it leads you through it step by step so that it fully available to the motivated reader.
Most recent customer reviews
As a computer scientist for 20 years, few books have had as long lasting an impact as this book.Read more