Algorithms in C++ : Findamentals, Data Structures, Sorting, Searching

Customers who bought this book also bought:

Algorithms in C++; Robert Sedgewick
C++ Solutions : Companion to the C++ Programming Language; David Vandevoorde, David Vandervoorde
Expert C Programming : Deep C Secrets; Peter van der Linden, Peter Van Der Linden
C : A Reference Manual; Samuel P. Harbison, Guy L. Steele (Contributor)

Reviews
Book Description
Robert Sedgewick has thoroughly rewritten and substantially expanded andupdated his popular work to provide current and comprehensive coverage ofimportant algorithms and data structures. Christopher Van Wyk and Sedgewickhave developed new C++ implementations that both express the methods in aconcise and direct manner, and also provide programmers with the practicalmeans to test them on real applications. Many new algorithms are presented, and the explanations of each algorithmare much more detailed than in previous editions. A new text design anddetailed, innovative figures, with accompanying commentary, greatly enhancethe presentation. The third edition retains the successful blend of theory andpractice that has made Sedgewick's work an invaluable resource for more than250,000 programmers! This particular book, Parts 1-4, represents the essential first half of Sedgewick'scomplete work. It provides extensive coverage of fundamental data structuresand algorithms for sorting, searching, and related applications. Although thesubstance of the book applies to programming in any language, theimplementations by Van Wyk and Sedgewick also exploit the natural matchbetween 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.

Back to General
Back to Algorithms
Back to Main Index