Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching

By Vikram Vaswani

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 Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.

• Format: Paperback
• Language: English
• ISBN: 0201314525
• ISBN13: 9780201314526
• Release Date: September 1997
• Publisher: Addison-Wesley Professional
• Length: 720 Pages
• Weight: 2.51 lbs.
• Dimensions: 1.1" x 7.8" x 9.2"

Customer Reviews

A Classic on Algorithms...

...that is as relevant today as when it was first written. As a computer scientist for 20 years, few books have had as long lasting an impact as this book. What has always amazed me is that once you've worked your way through an algorithm, and Sedgewick's explanation, you remember it. For me, it was, and still is, a foundation of computer science and as ready a reference today. Really liked the writing style, Sedgewick...

Great book a must have

This is one of the best book that I have ever read. The writer explained data stucture in a very good detail. However, this is NOT a book for those beginers, writer assumed that readers must have some strong background in both C programming and math. As many C code functions are left out. There is a clear difference between IT and computer science, if you just make web pages, click mouse in windows, know a little bit about...

A good overview of algorithms...

I haven't been into algorithms and such things for very long, and yet I find that, with a bit of patience and good will, it's not that hard to understand, contrary to some other review. Of course, it's a long book, but then, if you can't be perseverant enough to read such a book, the best solution is just to stay home and do something else! If you want the information given in the book, you're jolly well goning to have...

Exceptional love for fine detail of highest quality

There are many books about algorithms, just a few can impress and influence people acting on the very threshold between theoretical research and development of complex software. Robert Sedgewick codes very carefully. Some readers might even fail to recognize the fine details in his code. Try to analyse even the simplest 2-3 liners. Compare the program 4.5 (Linked list implementation of a pushdown stack) or 4.10 (FIFO queue...

A Great Book on Algorithms

Robert does a good job of explaining the algorithms in this book, and there are quite a few algorithms. The sample code is short so you don't have to read through lots of user interface and driver code to get to the actual algorithm, and it is written so that it isn't hard to copy the code into your own programs and get it to work. The chapter on Introduction to the Analasys of Algorithms has lots of math in it, but the rest...