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

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.HighlightsExpanded coverage of arrays, linked lists, strings, trees, and other basic data structuresGreater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editionsOver 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementationsNew implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much moreIncreased quantitative information about the algorithms, giving you a basis for comparing themOver 1000 new exercises to help you learn the properties of algorithmsWhether 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.