Basic knowledge. Data structures. Sorting and searching - Algorithms: C language implementation - Classic original book library (Parts 1-4) (English Edition. 3rd Edition)

Author: Sedgewick
Publisher:
Publish Date: 2006-09-01
Features: This is the book in Sedgewick's thoroughly revised and rewritten C algorithm series. The book is divided into four parts, totaling 16 chapters.
Part "Fundamentals" (Chapters 1~2) introduces the basic principles of algorithm analysis.
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.
Part "Sorting" (Chapters 6~11) discusses various sorting methods in chapter 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 different sorting methods.
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 numerous 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 a favorite among programmers since its release.
This book can serve 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.