Robert Sedgewick has thoroughly rewritten and substantially expanded andupdated popular work to provide current algorithms and comprehensive coverage ofimportant and data structures. It provides extensive coverage of fundamental data structuresand algorithms for sorting, searching, and related applications. Although thesubstance book applies to programming in any language, theimplementations by Van Wyk and Sedgewick also exploit the natural matchbetween C + + classes and ADT implementations. Highlights Expanding the scope of arrays, linked lists, strings, trees, and other basic data structures larger emphasis on abstract data types (ADTs), modular programming, object-oriented programming and C + + class compared to previous editions More than 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations New implementation of binomial queues, multiway radix sorting, randomized BSTs, wide tree, skip lists, multiway tries, B trees, extended hashing, and much more Increased quantitative information about the algorithms, giving you basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms Whether you are studying algorithms for the first time or want to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find many useful information in this book.