國(guó)外教材：算法I-IV-基礎(chǔ)、數(shù)據(jù)結(jié)構(gòu)、排序和搜索（第3版影印版）

定　價(jià)：￥70.00

作　者：	塞奇威克 Sedgewick
出版社：	中國(guó)電力出版社
叢編項(xiàng)：	原版風(fēng)暴系列
標(biāo)　簽：	暫缺

購(gòu)買這本書可以去

ISBN：	9787508314815	出版時(shí)間：	2003-11-01	包裝：	膠版紙
開本：	16	頁(yè)數(shù)：	704	字?jǐn)?shù)：

內(nèi)容簡(jiǎn)介

　　作者徹底重寫并充分?jǐn)U展了該書的前幾個(gè)版本，對(duì)各個(gè)領(lǐng)域中當(dāng)前流行的主要算法和數(shù)據(jù)結(jié)構(gòu)進(jìn)行了講解。書中介紹了很多新算法，并且針對(duì)每一種算法做出了詳細(xì)解釋，其程度超過了以往的各個(gè)版本。創(chuàng)新且詳細(xì)的文本安排，新的圖表形式，書后附加的注釋，以及非常棒的陳述方式。第三本依然延續(xù)了理論與實(shí)踐相結(jié)合的書寫風(fēng)格，這使得該書面向的讀者超過了250000人。本書講述的是作者全部工作的前半部分。書中講述了各個(gè)領(lǐng)域中的基礎(chǔ)數(shù)據(jù)結(jié)構(gòu)、排序算法、搜索，以及相關(guān)的應(yīng)用程序。通過用C語言簡(jiǎn)單地實(shí)現(xiàn)書中的算法和數(shù)據(jù)結(jié)構(gòu)，可幫助你在學(xué)習(xí)算法及數(shù)據(jù)結(jié)構(gòu)的基本特性的同時(shí)，在實(shí)際應(yīng)用中測(cè)試它們。當(dāng)然，本書的價(jià)值所在并不局限于某種語言。本書特點(diǎn)：擴(kuò)展介紹了數(shù)組、鏈表、串、樹和其他基本數(shù)據(jù)結(jié)構(gòu)；比以前版更為強(qiáng)調(diào)抽象數(shù)據(jù)類型（ADT）；為排序、選擇、優(yōu)先隊(duì)列ADT實(shí)現(xiàn)和符號(hào)表ADT（查找）實(shí)現(xiàn)提供了多達(dá)100余個(gè)算法；提供了雙端隊(duì)列、多路基數(shù)排序、Batcher排序網(wǎng)、隨機(jī)BST、伸展做、跳表、多路tries，以及其他一些新的數(shù)據(jù)結(jié)構(gòu)；對(duì)算法提供了更多量化信息，包括大量實(shí)驗(yàn)研究和基本分析研究，從而為對(duì)其加以比較提供了一個(gè)基礎(chǔ)；提供了多達(dá)1000余個(gè)新練習(xí)，從而有助于你了解算法的特性。無論你是一個(gè)實(shí)效學(xué)習(xí)算法的學(xué)生，抑或是一個(gè)醉心于掌握最新參考資料的專業(yè)人士，在本書中都將獲得大量有用信息。

作者簡(jiǎn)介

　　RobertSedgewick是普林斯頓大學(xué)的計(jì)算機(jī)科學(xué)教授。他于斯坦福大學(xué)獲得博士學(xué)位（師從DonaldE.Knuth）。Sedgewick是AdobeSystems公司的主管，并且作為研究人員還曾供職于施樂的洛阿爾托研究中心（XeroxPARC）、美國(guó)國(guó)防部防御分析研究所（theinstituterforDefenseAnalyses）和法國(guó)國(guó)立計(jì)算機(jī)與自動(dòng)化研究所（INRIA）。Sedgewick（與PhilippeFlajolet）還合著有《AnIntroductiontotheAnalysisofAigorithms》一書。

圖書目錄

Fundamentals
Chapter 1. Introduction
1.1 Algorithms
1.2 A Sample Problem—Connectivity
1.3 Union-Find Algorithms
1.4 Perspective
1.5 Summary of Topics
Chapter 2. Principles of Algorithm Analysis
2.1 Implementation and Empirical Analysis
2.2 Analysis of Algorithms
2.3 Growth of Functions
2.4 Big-Oh notation
2.5 Basic Recurrences
2.6 Examples of Algorithm Analysis
2.7 Guarantees, Predictions, and Limitations
Data Structures
Chapter 3. Elementary Data Structures
3.1 Building Blocks
3.2 Arrays
3.3 Linked Lists
3.4 Elementary List Processing
3.5 Memory Allocation for Lists
3.6 Strings
3.7 Compound Data Structures
Chapter 4. Abstract Data Types
4.1 Abstract Objects and Collections of Objects
4.2 Pushdown Stack ADT
4.3 Examples of Stack ADT Clients
4.4 Stack ADT Implementations
4.5 Creation of a New ADT
4.6 FIFO Queues and Generalized Queues
4.7 Duplicate and Index Items
4.8 First-Class ADTs
4.9 Application-Based ADT Example
4.10 Perspective
Chapter 5. Recursion and Trees
5.1 Recursive Algorithms
5.2 Divide and Conquer
5.3 Dynamic Programming
5.4 Trees
5.5 Mathematical Properties of Trees
5.6 Tree Traversal
5.7 Recursive Binary-Tree Algorithms
5.8 Graph Traversal
5.9 Perspective
Sorting
Chapter 6. Elementary Sorting Methods
6.1 Rules of the Game
6.2 Selection Sort
6.3 Insertion Sort
6.4 Bubble Sort
6.5 Performance Characteristics of Elementary Sorts
6.6 Shellsort
6.7 Sorting Other Types of Data
6.8 Index and Pointer Sorting
6.9 Sorting of Linked Lists
6.10 Key-Indexed Counting
Chapter 7. Quicksort
7.1 The Basic Algorithm
7.2 Performance Characteristics of Quicksort
7.3 Stack Size
7.4 Small Subfiles
7.5 Median-of-Three Partitioning
7.6 Duplicate Keys
7.7 Strings and Vectors
7.8 Selection
Chapter 8. Merging and Mergesor
8.1 Two-Way Merging
8.2 Abstract In-place Merge
8.3 Top-Down Mergesort
8.4 Improvements to the Basic Algorithm
8.5 Bottom-Up Mergesort
8.6 Performance Characteristics of Mergesort
8.7 Linked-List Implementations of Mergesort
8.8 Recursion Revisited
Chapter 9. Priority Queues and Heapsort
9.1 Elementary Implementations
9.2 Heap Data Structure
9.3 Algorithms on Heaps
9.4 Heapsort
9.5 Priority-Queue ADT
9.6 Priority Queues of for Index Items
9.7 Binomial Queues
Chapter 10. Radix Sorting
10.1 Bits, Bytes, and Words
10.2 Binary Quicksort
10.3 MSD Radix Sort
10.4 Three-Way Radix Quicksort
10.5 LSD Radix Sort
10.6 Performance Characteristics of Radix Sorts
10.7 Sublinear-Time Sorts
Chapter 11. Special-Purpose Sorts
11.1 Batcher`s Odd-Even Mergesort
11.2 Sorting Networks
11.3 External Sorting
11.4 Sort-Merge Implementations
11.5 Parallel Sort/Merge
Searching
Chapter 12. Symbol Tables and BSTs
12.1 Symbol-Table Abstract Data Type
12.2 Key-Indexed Search
12.3 Sequential Search
12.4 Binary Search
12.5 Binary Search Trees(BSTs)
12.6 Performance Characteristics of BSTs
12.7 Index Implementations with Symbol Tables
12.8 Insertion at the Root in BSTs
12.9 BST Implementations of Other ADT Functions
Chapter 13. Balanced Trees
13.1 Randomized BSTs
13.2 Splay BSTs
13.3 Top-Down 2-3-4 Trees
13.4 Red-Black Trees
13.5 Skip Lists
13.6 Performance Characteristics
Chapter 14. Hashing
14.1 Hash Functions
14.2 Separate Chaining
14.3 Linear Probing
14.4 Double Hashing
14.5 Dynamic Hash Tables
14.6 Perspective
Chapter 15. Radix Search
15.1 Digital Search Trees
15.2 Tries
15.3 Patricia Tries
15.4 Multiway Tries and TSTs
15.5 Text String Index Algorithms
Chapter 16. External Searching
16.1 Rules of the Game
16.2 Indexed Sequential Access
16.3 B Trees
16.4 Extendible Hashing
16.5 Perspective
Intex