Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, 3/e (Paperback)
Robert Sedgewick
- 出版商: Addison Wesley
- 出版日期: 1998-07-23
- 售價: $2,475
- 貴賓價: 9.5 折 $2,351
- 語言: 英文
- 頁數: 752
- 裝訂: Paperback
- ISBN: 0201350882
- ISBN-13: 9780201350883
-
相關分類:
C++ 程式語言、資料結構與演算法 Algorithms-data-structures
立即出貨 (庫存 < 4)
買這商品的人也買了...
-
![]()
$1,425$1,350Mastering Algorithms with C (Paperback)
-
![]()
$680$544計算機組織與設計--軟硬體界面第二版 (Computer Organization & Design, 2/e)
-
![]()
$720$576SQL 語法查詢百科 (SQL Fundamentals, 2/e)
-
![]()
$780$624UML 與樣式徹底研究 (Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and the Unified Process, 2/e)
-
![]()
$690$587C++ Builder 6 完全攻略
-
![]()
$780$624敏捷軟體開發：原則、樣式及實務 (Agile Software Development: Principles, Patterns, and Practices)
-
![]()
$680$646計算機組織與設計 (Computer Organization and Design: The Hardware/Software Interface, 3/e)
-
![]()
$1,200$1,140C++ Primer, 4/e (Paperback)
-
![]()
$880$695深入淺出 Java 程式設計, 2/e (Head First Java, 2/e)
-
![]()
$2,100$1,995Algorithms in C++ Part 5: Graph Algorithms, 3/e (Paperback)
-
![]()
$299Communication Skills Handbook (Paperback)
-
![]()
$999OpenGL Shading Language, 2/e (Paperback)
-
![]()
$580$493Ajax 網頁程式設計─Google 成功背後的技術
-
![]()
$650$507ASP.NET 2.0 深度剖析範例集
-
![]()
$680$578PHP + MySQL 快速入門
-
![]()
$999CMMI: Guidelines for Process Integration and Product Improvement, 2/e
-
![]()
$1,100$1,078Digital Design, 4/e (IE-Paperback)
-
![]()
$880$695深入淺出物件導向分析與設計 (Head First Object-Oriented Analysis and Design)
-
![]()
$650$520C++ Primer Plus, 5/e 中文豪華版
-
![]()
$980$774深入淺出 C# (Head First C#)
-
![]()
$400$340簡單學會 Flash ActionScript 3.0
-
![]()
$490$417程式之美－微軟技術面試心得
-
![]()
$925Criminalistics: An Introduction to Forensic Science, 9/e[Hardcover]
-
![]()
$890$757Google Android SDK 開發範例大全 2
-
![]()
$1,500$1,425Cracking the Coding Interview : 189 Programming Questions and Solutions, 6/e (Paperback)
商品描述
Description
For this version of Robert Sedgewick's popular textbook on algorithms and data structures, Christopher Van Wyk and Robert Sedgewick have developed new C++ implementations that both express the presented methods in a concise and direct manner, and also provide students with the practical means to test them on real applications.
This particular book, Parts 1-4, represents a substantial update of the first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The update features expanded coverage of arrays, linked lists, strings, trees, and other basic data structures, and greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions. It includes over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations, and over 1,000 new exercises to help students learn the properties of algorithms. 
Table Of Contents
FUNDAMENTALS.
A Sample Problem-Connectivity.
Union-Find Algorithms.
Perspective.
Summary of Topics.
2. Principles of Algorithm Analysis.
Analysis of Algorithms.
Growth of Functions.
Big-Oh Notation.
Basic Recurrences.
Examples of Algorithm Analysis.
Guarantees, Predictions, and Limitations.
DATA STRUCTURES.
Arrays.
Linked Lists.
Elementary List Processing.
Memory Allocation for Lists.
Strings.
Compound Data Structures.
4. Abstract Data Types.
Pushdown Stack ADT.
Examples of Stack ADT Clients.
Stack ADT Implementations.
Creation of a New ADT.
FIFO Queues and Generalized Queues.
Duplicate and Index Items.
First-Class ADTs.
Application-Based ADT Example.
Perspective.
5. Recursion and Trees.
Divide and Conquer.
Dynamic Programming.
Trees.
Mathematical Properties of Trees.
Tree Traversal.
Recursive Binary-Tree Algorithms.
Graph Traversal.
Perspective.
SORTING.
Selection Sort.
Insertion Sort.
Bubble Sort.
Performance Characteristics of Elementary Sorts.
Shellsort.
Sorting Other Types of Data.
Index and Pointer Sorting.
Sorting Linked Lists.
Key-Indexed Counting.
7. Quicksort.
Performance Characteristics of Quicksort.
Stack Size.
Small Subfiles.
Median-of-Three Partitioning.
Duplicate Keys.
Strings and Vectors.
Selection.
8. Merging and Mergesort.
Abstract In-Place Merge.
Top-Down Mergesort.
Improvements to the Basic Algorithm.
Bottom-Up Mergesort.
Performance Characteristics of Mergesort.
Linked-List Implementations of Mergesort.
Recursion Revisited.
9. Priority Queues and Heapsort.
Heap Data Structure.
Algorithms on Heaps.
Heapsort.
Priority-Queue ADT.
Priority Queues for Index Items.
Binomial Queues.
10. Radix Sorting.
Binary Quicksort.
MSD Radix Sort.
Three-Way Radix Quicksort.
LSD Radix Sort.
Performance Characteristics of Radix Sorts.
Sublinear-Time Sorts.
11. Special-Purpose Sorts.
Sorting Networks.
External Sorting.
Sort-Merge Implementations.
Parallel Sort/Merge.
SEARCHING.
Key-Indexed Search.
Sequential Search.
Binary Search.
Binary Search Trees (BSTs).
Performance Characteristics of BSTs.
Index Implementations with Symbol Tables.
Insertion at the Root in BSTs.
BST Implementations of Other ADT Functions.
13. Balanced Trees.
Splay BSTs.
Top-Down 2-3-4 Trees.
Red-Black Trees.
Skip Lists.
Performance Characteristics.
Separate Chaining.
Linear Probing.
Double Hashing.
Dynamic Hash Tables.
Perspective.
15. Radix Search.
Tries.
Patricia Tries.
Multiway Tries and TSTs.
Text String Index Applications.
16. External Searching.
Indexed Sequential Access.
B Trees.
Extendible Hashing.
Perspective.
Index. 0201350882T04062001