Title Page
by Robert Sedgewick
Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching, Third Edition
- About This eBook
- Title Page
- Copyright Page
- Preface
- Dedication Page
- Notes on Exercises
- Contents
- Part One: Fundamentals
- Part Two: Data Structures
- Chapter Three. Elementary Data Structures
- Chapter Four. Abstract Data Types
- 4.1 Abstract Objects and Collections of Objects
- Exercises
- 4.2 Pushdown Stack ADT
- Exercises
- 4.3 Examples of Stack ADT Clients
- Exercises
- 4.4 Stack ADT Implementations
- Exercises
- 4.5 Creation of a New ADT
- Exercises
- 4.6 FIFO Queues and Generalized Queues
- Exercises
- 4.7 Duplicate and Index Items
- Exercises
- 4.8 First-Class ADTs
- Exercises
- 4.9 Application-Based ADT Example
- Exercises
- 4.10 Perspective
- Chapter Five. Recursion and Trees
- References for Part Two
- Part Three: Sorting
- Chapter Six. Elementary Sorting Methods
- 6.1 Rules of the Game
- Exercises
- 6.2 Selection Sort
- Exercises
- 6.3 Insertion Sort
- Exercises
- 6.4 Bubble Sort
- Exercises
- 6.5 Performance Characteristics of Elementary Sorts
- Exercises
- 6.6 Shellsort
- Exercises
- 6.7 Sorting of Other Types of Data
- Exercises
- 6.8 Index and Pointer Sorting
- Exercises
- 6.9 Sorting of Linked Lists
- Exercises
- 6.10 Key-Indexed Counting
- Exercises
- Chapter Seven. Quicksort
- Chapter Eight. Merging and Mergesort
- 8.1 Two-Way Merging
- Exercises
- 8.2 Abstract In-place Merge
- Exercises
- 8.3 Top-Down Mergesort
- Exercises
- 8.4 Improvements to the Basic Algorithm
- Exercises
- 8.5 Bottom-Up Mergesort
- Exercises
- 8.6 Performance Characteristics of Mergesort
- Exercises
- 8.7 Linked-List Implementations of Mergesort
- Exercises
- 8.8 Recursion Revisited
- Exercises
- Chapter Nine. Priority Queues and Heapsort
- Chapter Ten. Radix Sorting
- Chapter Eleven. Special-Purpose Sorting Methods
- References for Part Three
- Chapter Six. Elementary Sorting Methods
- Part Four: Searching
- Chapter Twelve. Symbol Tables and Binary Search Trees
- 12.1 Symbol-Table Abstract Data Type
- Exercises
- 12.2 Key-Indexed Search
- Exercises
- 12.3 Sequential Search
- Exercises
- 12.4 Binary Search
- Exercises
- 12.5 Binary Search Trees (BSTs)
- Exercises
- 12.6 Performance Characteristics of BSTs
- Exercises
- 12.7 Index Implementations with Symbol Tables
- Exercises
- 12.8 Insertion at the Root in BSTs
- Exercises
- 12.9 BST Implementations of Other ADT Functions
- Exercises
- Chapter Thirteen. Balanced Trees
- Chapter Fourteen. Hashing
- Chapter Fifteen. Radix Search
- Chapter Sixteen. External Searching
- Chapter Twelve. Symbol Tables and Binary Search Trees
- References for Part Four
- Index
- Code Snippets
Algorithms in C
THIRD EDITION
PARTS 1–4
FUNDAMENTALS
DATA STRUCTURES
SORTING
SEARCHING
Robert Sedgewick
Princeton University
An imprint of Addison Wesley Longman, Inc.
Reading, Massachusetts • Harlow, England • Menlo Park, California
Berkeley, California • Don Mills, Ontario • Sydney • Bonn • Amsterdam
Tokyo • Mexico City
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.