Algorithm I-IV (C++ Implementation) -- Basic Data Structure Sorting and Searching (Third Edition)

Author: Robert Sedgewick (USA), translated by Zhang Mingze et al.
Publisher:
Publish Date: 2004-02-01
Features: Robert Sedgewick completely rewrote his work, fully expanded and updated, covering currently important algorithms and data structures. Christopher Van Wyk and Sedgewick developed new implementations using C++, which not only directly express algorithms but also provide programmers with practical methods to test these algorithms in real-world applications. The new edition offers many new algorithms, and the explanations for each algorithm are much more detailed than previous versions. The new layout design, along with detailed, creative, and annotated illustrations, greatly enhances the book's expressiveness. The third edition retains the successful blend of theory and practice, which is precisely why Sedgewick's work has become an invaluable reference resource for 250,000 programmers. This book covers the first half of the full volume, including basic data structures, sorting algorithms, search algorithms, and their related applications. Although the book can essentially be used for programming in various languages, Christopher Van Wyk and Sedgewick's implementations naturally correspond to C++ classes and ADT implementations. The highlights of this book include:
● Expanded introduction to arrays, linked lists, string trees, and other basic data structures.
● Greater emphasis on abstract data types (ADT), modular programming methods, object-oriented programming methods, and C++ classes compared to previous versions.
● Over 100 algorithms related to sorting, selection, priority queue ADT implementations, and symbol table ADT (search) implementations.
● New implementations of binomial queues, multiway radix sorting, randomized BSTs, divergent trees, skip lists, multiway threads, 8-trees, and extensible hashing.
● Quantitative analysis of algorithms, which serves as the basis for comparing algorithms.
● Over 1,000 new exercises to help readers learn algorithms.
Whether you are a beginner in algorithms or looking for a reference manual that integrates new C++ classic algorithms and new algorithms into programming design, you will find this book provides rich and useful information.