Algorithms In C++: Parts 1-4; Fundamentals, Data Structures, Sorting, And Searching; Author: Sedgewick, Robert; Paperback

Author: Sedgewick, Robert
Edition #3; Paperback
720 pages
Published: September 1998
Pearson Higher Education
ISBN: 0201350882

This is the latest offering in the Algorithms series from esteemed author and former Donald Knuth student, Robert Sedgewick. Using C++, Parts 1-4 of Sedgewick's work provide extensive data structures and algorithms for sorting, searching, and related applications. They reflect the third edition's greater emphasis on abstract data types (ADTs). Coverage includes more than 100 key algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations. Also included are new implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, and multiway tries.3RD EDITION This text on algorithms and data structures develops C++ implementations that express methods in a concise manner, and provides students with practical means to test C++ on real applications. It covers: fundamental data structures and algorithms for sorting, searching and related applications.