Algorithm: C Language Implementation (Parts 1-4): Fundamentals, Data Structures, Sorting, and Searching (English Version, 3rd Edition)

Author: Robert Sedgewick (USA)
Publisher:
Publishing Date: Not available
Features: This book is the definitive revision and rewrite of Sedgewick's C algorithm series. It is divided into four parts, totaling 16 chapters.
Part "Fundamentals" (Chapters 1~2) introduces the basic principles of algorithm analysis. The second part "Data Structures" (Chapters 3~5) explains the essential data structures required for algorithm analysis, including basic data structures, abstract data structures, recursion, and trees. The third part "Sorting" (Chapters 6~11) discusses various sorting methods in order, including basic sorting methods (such as selection sort, insertion sort, bubble sort, and shell sort), quicksort, merge and merge sort, priority queues and heap sort, radix sort, and special-purpose sorting methods, comparing the performance characteristics of various sorting methods. The fourth part "Searching" (Chapters 12~16) further explains abstract data types such as symbol tables and trees, with a focus on hash methods, radix search, and external search methods. The book provides complete algorithm source code written in C, accompanied by rich illustrations and exercises. The author successfully combines theory and practice with concise implementations, all of which can be tested in real-world applications, making the book highly popular among programmers since its release. This book can be used as a textbook and supplementary reading for algorithm and data structure courses in computer-related disciplines at universities and colleges, as well as for self-study.