Essential Information about Algorithms and Data Structures

 

 

 

 

 

 

 

 

 

 

A Classic Reference

 

 

 

The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades.

 

 

 

 

 

 

 

 

 

Broad Coverage

 

 

 

Full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing, including fifty algorithms every programmer should know. See algs4.cs.princeton.edu/code.

 

 

 

 

 

 

Completely Revised Code

 

 

 

New Java implementations written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.

 

 

 

 

 

 

Engages with Applications

 

 

 

Algorithms are studied in the context of important scientific, engineering, and commercial applications. Clients and algorithms are expressed in real code, not the pseudo-code found in many other books.

 

 

 

 

 

 

Intellectually Stimulating

 

 

 

Engages reader interest with clear, concise text, detailed examples with visuals, carefully crafted code, historical and scientific context, and exercises at all levels.

 

 

 

 

 

 

A Scientific Approach

 

 

 

Develops precise statements about performance, supported by appropriate mathematical models and empirical studies validating those models.

 

 

 

 

 

 

Integrated with the Web

 

 

 

Visit algs4.cs.princeton.edu for a freely accessible, comprehensive Web site, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources.

 

 

 

 

Contents

Chapter 1: Fundamentals

Programming Model

Data Abstraction

Bags, Stacks, and Queues

Analysis of Algorithms

Case Study: Union-Find

 

Chapter 2: Sorting

Elementary Sorts

Mergesort

Quicksort

Priority Queues

Applications

 

Chapter 3: Searching

Symbol Tables

Binary Search Trees

Balanced Search Trees

Hash Tables

Applications

 

Chapter 4: Graphs

Undirected Graphs

Directed Graphs

Minimum Spanning Trees

Shortest Paths

 

Chapter 5: Strings

String Sorts

Tries

Substring Search

Regular Expressions

Data Compression

 

Chapter 6: Context

重要資訊：演算法和資料結構的基本知識

《演算法和資料結構基本資訊》是Sedgewick最暢銷系列的最新版本，反映了過去幾十年來發展出的不可或缺的知識體系。

廣泛涵蓋：完整介紹了排序、搜尋、圖形處理和字串處理等資料結構和演算法，包括每位程式設計師都應該熟悉的五十個演算法。請參閱algs4.cs.princeton.edu/code。

完全修訂的程式碼：以易於理解的模組化程式設計風格撰寫的新Java實現，讓讀者可以直接使用並了解所有程式碼。

與應用相關：在重要的科學、工程和商業應用背景下研究演算法。客戶端和演算法以真實程式碼表示，而非其他書籍中常見的偽代碼。

智力刺激：以清晰、簡潔的文字和詳細的示例吸引讀者的興趣。