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 Schidlowsky and Sedgewick also exploit the natural match between Java classes and abstract data type (ADT) implementations.HighlightsJava class implementations of more than 100 important practical algorithmsEmphasis on ADTs, modular programming, and object-oriented programmingExtensive coverage of arrays, linked lists, trees, and other fundamental data structuresThorough treatment of algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT implementations (search algorithms)Complete implementations for binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and many other advanced methodsQuantitative information about the algorithms that gives you a basis for comparing themMore than 1, 000 exercises and more than 250 detailed figures to help you learn properties of the 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.
0201361205B08282002
Share This Book: