DataStructuresandAlgorithmAnalysisinC - (EPUB全文下载)
文件大小:5.4 mb。
文件格式:epub 格式。
书籍内容:
Main Page
Table of Contents
Preface
Chapter 1: Introduction
1.1. What's the Book About?
1.2. Mathematics Review
1.2.1. Exponents
1.2.2. Logarithms
1.2.3. Series
1.2.4. Modular Arithmetic
1.2.5. The P Word
1.3. A Brief Introduction to Recursion
Exercises
Chapter 2: Algorithm Analysis
2.1. Mathematical Background
2.2. Model
2.3. What to Analyze
2.4. Running Time Calculations
2.4.1. A Simple Example
2.4.2. General Rules
2.4.3 Solutions for the Maximum Subsequence Sum Problem
2.4.4 Logarithms in the Running Time
2.4.5 Checking Your Analysis
2.4.6. A Grain of Salt
Exercises
Chapter 3: Lists, Stacks, And Queues
3.1. Abstract Data Types (ADTs)
3.2. The List ADT
3.2.1. Simple Array Implementation of Lists
3.2.2. Linked Lists
3.2.3. Programming Details
3.2.4. Common Errors
3.2.5. Doubly Linked Lists
3.2.6. Circularly Linked Lists
3.2.7. Examples
3.2.8. Cursor Implementation of Linked Lists
3.3. The Stack ADT
3.3.1. Stack Model
3.3.2. Implementation of Stacks
3.3.3. Applications
3.4. The Queue ADT
3.4.1. Queue Model
3.4.2. Array Implementation of Queues
3.4.3. Applications of Queues
Exercises
Chapter 4: Trees
4.1. Preliminaries
4.1.1. Implementation of Trees
4.1.2. Tree Traversals with an Application
4.2. Binary Trees
4.2.1. Implementation
4.2.2. Expression Trees
4.3. The Search Tree ADT-Binary Search Trees
4.3.1. Make_null
4.3.2. Find
4.3.3. Find_min and find_max
4.3.4. Insert
4.3.5. Delete
4.3.6. Average-Case Analysis
4.4.
4.4.1. Single Rotation
4.4.2. Double Rotation
4.5. Splay Trees
4.5.1. A Simple Idea (That Does Not Work)
4.5.2. Splaying
4.6. Tree Traversals (Revisited)
4.7. B-Trees
Exercises
Chapter 5: Hashing
5.1. General Idea
5.2. Hash Function
5.3. Open Hashing (Separate Chaining)
5.4. Closed Hashing (Open Addressing)
5.4.1. Linear Probing
5.4.2. Quadratic Probing
5.4.3. Double Hashing
5.5. Rehashing
5.6. Extendible Hashing
Exercises
Chapter 6: Priority Queues (Heaps)
6.1. Model
6.2. Simple Implementations
6.3. Binary Heap
6.3.1. Structure Property
6.3.2. Heap Order Property
6.3.3. Basic Heap Operations
6.3.4. Other Heap Operations
6.4. Applications of Priority Queues
6.4.1. The Selection Problem
6.4.2. Event Simulation
6.5. d-Heaps
6.6. Leftist Heaps
6.6.1. Leftist Heap Property
6.6.2. Leftist Heap Operations
6.7. Skew Heaps
6.8. Binomial Queues
6.8.1. Binomial Queue Structure
6.8.2. Binomial Queue Operations
6.8.3. Implementation of Binomial Queues
Exercises
Chapter 7: Sorting
7.1. Preliminaries
7.2. Insertion Sort
7.2.1. The Algorithm
7.2.2. Analysis of ............
书籍插图:
以上为书籍内容预览,如需阅读全文内容请下载EPUB源文件,祝您阅读愉快。
书云 Open E-Library » DataStructuresandAlgorithmAnalysisinC - (EPUB全文下载)