Algorithms and Data Structures

Author: Chen Yuan / He Bo / Tu Xiaohong, etc. He Bo Tu Xiaohong
Publisher:
Publish Date: 2005-04-01
Features: This book is a undergraduate textbook for computer science and related majors in higher education institutions. It systematically introduces the fundamental knowledge of algorithms and data structures. Its main contents include: basic concepts and terminology of data structures and algorithms, basic data types of C language and key points of describing algorithms in C language; the logical structure of linear lists, the sequential storage structure and linked storage structure of linear lists, and application examples of array linear lists; the basic concepts and storage structures of stacks and queues, and application examples of stacks and queues; the basic concepts and storage structures of strings, and application examples of strings; the basic concepts and storage structures of trees and binary trees, binary tree applications—Huffman trees and coding; the basic concepts and storage structures of graphs, graph traversal, graph spanning trees and minimum spanning trees, shortest paths, directed acyclic graphs, and application examples of graphs; static search, dynamic search, and hash table search; insertion sort, selection sort, exchange sort, merge sort, radix sort, and an introduction to external sorting; the concept and design methods of recursion, the relationship between recursion and backtracking, and application examples of recursion techniques. Through in-depth learning and analysis, readers can significantly improve their software development and design capabilities. All algorithms and programs provided in this book are described in C language and have been debugged. Each chapter includes a summary, exercises, and computer practice exercises. Additionally, the appendix provides course design requirements and content, making it convenient for use as a textbook or teaching supplement.