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

By Robert Sedgewick

Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications. 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 1n4, 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. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations. Highlights Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes 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, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more Increased quantitative information about the algorithms, giving you a basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

• Format: Paperback
• Language: English
• ISBN: 0201350882
• ISBN13: 9780201350883
• Release Date: July 1998
• Publisher: Addison-Wesley Professional
• Length: 752 Pages
• Weight: 2.63 lbs.
• Dimensions: 1.1" x 7.7" x 9.3"

Customer Reviews

If you want to _really_ understand red-black trees.....

Any professional programmer would benefit from having these books at hand. Excellent discussions of the basic algorithms which every programmer needs to know. But I would like to particularly highlight the discussions on binary and n-ary search trees. The most enlightening discussion in print, giving the reader a real synoptic view of search tree algorithms, how they evolved, and their culmination in red-black trees. ...

Excellent, Exhaustive (but not rigorous)

If you're looking for an exhaustive, upto-date reference/textbook for fundamental, searching and sorting algorithms, then this is one of the very best available. Sedgewick has split his popular book into two volumes, with Graph algorithms being hifted to the second volume. Moreover, many advanced topics like computational geometry, fft, number theoretic algorithms etc, which were introduced in the previous edition, seem...

good algorithm book for programmers

This book delivers what it says on the title and nothing more; Fundamentals, data structures, sorting, and searching. In my opinion, the topics covered in this book are just perfect for beginners. Its not too much and not too little. This book does a very good of explaining the pros and cons of each algorithm, how they're implemented, and when they should be used. As far as Math. goes, this book doesn't deal a whole lot with...

MUCH better than his previous "C++" work...

If at first you don't succeed...Sedgewick's first cut at "Algorithms in C++" was a sick joke; the code was often incorrect and very difficult for even an intermediate C programmer to follow. In addition, there was virtually no difference between the C and C++ algorithms. In fact, that's why I put C++ in quotes in the title -- calling it representative C++ code was an extreme stretch.It took several years, but Sedgewick...

A good First Book on Algorithms

This text is an excellent choice to learn about the data structures most commonly employed in C++. The author breaks down topics in to small well focused chapters that help beginning programmers concentrate on one structure at a time.The algorithms are treated in a comprehensive manner. Besides the usual sorting and graph techniques many advanced and specialized topics such as file compression and cryptology are discussed.In...