logo资料库

Data Structures and Algorithm Analysis in C++, 4th Edition PDF.pdf

发布时间：2022-06-09 发布人：admin 分类：说明书 资料大小：4.21M 资料格式：pdf 举报 版权申诉
第1页 / 共654页
第2页 / 共654页
第3页 / 共654页
第4页 / 共654页
第5页 / 共654页
第6页 / 共654页
第7页 / 共654页
第8页 / 共654页
资料共654页，剩余部分请下载后查看
    Cover
    Title Page
    Copyright Page
    Contents
    Preface
    Chapter 1 Programming: A General Overview
    1.1 What’s This 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
    1.4 C++ Classes
    1.4.1 Basic class Syntax
    1.4.2 Extra Constructor Syntax and Accessors
    1.4.3 Separation of Interface and Implementation
    1.4.4 vector and string
    1.5 C++ Details
    1.5.1 Pointers
    1.5.2 Lvalues, Rvalues, and References
    1.5.3 Parameter Passing
    1.5.4 Return Passing
    1.5.5 std::swap and std::move
    1.5.6 The Big-Five: Destructor, Copy Constructor, Move Constructor, Copy Assignment operator=, Move Assignment operator=
    1.5.7 C-style Arrays and Strings
    1.6 Templates
    1.6.1 Function Templates
    1.6.2 Class Templates
    1.6.3 Object, Comparable, and an Example
    1.6.4 Function Objects
    1.6.5 Separate Compilation of Class Templates
    1.7 Using Matrices
    1.7.1 The Data Members, Constructor, and Basic Accessors
    1.7.2 operator[]
    1.7.3 Big-Five
    Summary
    Exercises
    References
    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 Limitations of Worst-Case Analysis
    Summary
    Exercises
    References
    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 Simple Linked Lists
    3.3 vector and list in the STL
    3.3.1 Iterators
    3.3.2 Example: Using erase on a List
    3.3.3 const_iterators
    3.4 Implementation of vector
    3.5 Implementation of list
    3.6 The Stack ADT
    3.6.1 Stack Model
    3.6.2 Implementation of Stacks
    3.6.3 Applications
    3.7 The Queue ADT
    3.7.1 Queue Model
    3.7.2 Array Implementation of Queues
    3.7.3 Applications of Queues
    Summary
    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 An Example: Expression Trees
    4.3 The Search Tree ADT—Binary Search Trees
    4.3.1 contains
    4.3.2 findMin and findMax
    4.3.3 insert
    4.3.4 remove
    4.3.5 Destructor and Copy Constructor
    4.3.6 Average-Case Analysis
    4.4 AVL Trees
    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
    4.8 Sets and Maps in the Standard Library
    4.8.1 Sets
    4.8.2 Maps
    4.8.3 Implementation of set and map
    4.8.4 An Example That Uses Several Maps
    Summary
    Exercises
    References
    Chapter 5 Hashing
    5.1 General Idea
    5.2 Hash Function
    5.3 Separate Chaining
    5.4 Hash Tables without Linked Lists
    5.4.1 Linear Probing
    5.4.2 Quadratic Probing
    5.4.3 Double Hashing
    5.5 Rehashing
    5.6 Hash Tables in the Standard Library
    5.7 Hash Tables with Worst-Case O(1) Access
    5.7.1 Perfect Hashing
    5.7.2 Cuckoo Hashing
    5.7.3 Hopscotch Hashing
    5.8 Universal Hashing
    5.9 Extendible Hashing
    Summary
    Exercises
    References
    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
    6.9 Priority Queues in the Standard Library
    Summary
    Exercises
    References
    Chapter 7 Sorting
    7.1 Preliminaries
    7.2 Insertion Sort
    7.2.1 The Algorithm
    7.2.2 STL Implementation of Insertion Sort
    7.2.3 Analysis of Insertion Sort
    7.3 A Lower Bound for Simple Sorting Algorithms
    7.4 Shellsort
    7.4.1 Worst-Case Analysis of Shellsort
    7.5 Heapsort
    7.5.1 Analysis of Heapsort
    7.6 Mergesort
    7.6.1 Analysis of Mergesort
    7.7 Quicksort
    7.7.1 Picking the Pivot
    7.7.2 Partitioning Strategy
    7.7.3 Small Arrays
    7.7.4 Actual Quicksort Routines
    7.7.5 Analysis of Quicksort
    7.7.6 A Linear-Expected-Time Algorithm for Selection
    7.8 A General Lower Bound for Sorting
    7.8.1 Decision Trees
    7.9 Decision-Tree Lower Bounds for Selection Problems
    7.10 Adversary Lower Bounds
    7.11 Linear-Time Sorts: Bucket Sort and Radix Sort
    7.12 External Sorting
    7.12.1 Why We Need New Algorithms
    7.12.2 Model for External Sorting
    7.12.3 The Simple Algorithm
    7.12.4 Multiway Merge
    7.12.5 Polyphase Merge
    7.12.6 Replacement Selection
    Summary
    Exercises
    References
    Chapter 8 The Disjoint Sets Class
    8.1 Equivalence Relations
    8.2 The Dynamic Equivalence Problem
    8.3 Basic Data Structure
    8.4 Smart Union Algorithms
    8.5 Path Compression
    8.6 Worst Case for Union-by-Rank and Path Compression
    8.6.1 Slowly Growing Functions
    8.6.2 An Analysis by Recursive Decomposition
    8.6.3 An O( M log *N ) Bound
    8.6.4 An O( M α(M, N) ) Bound
    8.7 An Application
    Summary
    Exercises
    References
    Chapter 9 Graph Algorithms
    9.1 Definitions
    9.1.1 Representation of Graphs
    9.2 Topological Sort
    9.3 Shortest-Path Algorithms
    9.3.1 Unweighted Shortest Paths
    9.3.2 Dijkstra’s Algorithm
    9.3.3 Graphs with Negative Edge Costs
    9.3.4 Acyclic Graphs
    9.3.5 All-Pairs Shortest Path
    9.3.6 Shortest Path Example
    9.4 Network Flow Problems
    9.4.1 A Simple Maximum-Flow Algorithm
    9.5 Minimum Spanning Tree
    9.5.1 Prim’s Algorithm
    9.5.2 Kruskal’s Algorithm
    9.6 Applications of Depth-First Search
    9.6.1 Undirected Graphs
    9.6.2 Biconnectivity
    9.6.3 Euler Circuits
    9.6.4 Directed Graphs
    9.6.5 Finding Strong Components
    9.7 Introduction to NP-Completeness
    9.7.1 Easy vs. Hard
    9.7.2 The Class NP
    9.7.3 NP-Complete Problems
    Summary
    Exercises
    References
    Chapter 10 Algorithm Design Techniques
    10.1 Greedy Algorithms
    10.1.1 A Simple Scheduling Problem
    10.1.2 Huffman Codes
    10.1.3 Approximate Bin Packing
    10.2 Divide and Conquer
    10.2.1 Running Time of Divide-and-Conquer Algorithms
    10.2.2 Closest-Points Problem
    10.2.3 The Selection Problem
    10.2.4 Theoretical Improvements for Arithmetic Problems
    10.3 Dynamic Programming
    10.3.1 Using a Table Instead of Recursion
    10.3.2 Ordering Matrix Multiplications
    10.3.3 Optimal Binary Search Tree
    10.3.4 All-Pairs Shortest Path
    10.4 Randomized Algorithms
    10.4.1 Random-Number Generators
    10.4.2 Skip Lists
    10.4.3 Primality Testing
    10.5 Backtracking Algorithms
    10.5.1 The Turnpike Reconstruction Problem
    10.5.2 Games
    Summary
    Exercises
    References
    Chapter 11 Amortized Analysis
    11.1 An Unrelated Puzzle
    11.2 Binomial Queues
    11.3 Skew Heaps
    11.4 Fibonacci Heaps
    11.4.1 Cutting Nodes in Leftist Heaps
    11.4.2 Lazy Merging for Binomial Queues
    11.4.3 The Fibonacci Heap Operations
    11.4.4 Proof of the Time Bound
    11.5 Splay Trees
    Summary
    Exercises
    References
    Chapter 12 Advanced Data Structures and Implementation
    12.1 Top-Down Splay Trees
    12.2 Red-Black Trees
    12.2.1 Bottom-Up Insertion
    12.2.2 Top-Down Red-Black Trees
    12.2.3 Top-Down Deletion
    12.3 Treaps
    12.4 Sufix Arrays and Sufix Trees
    12.4.1 Sufix Arrays
    12.4.2 Sufix Trees
    12.4.3 Linear-Time Construction of Sufix Arrays and Sufix Trees
    12.5 k-d Trees
    12.6 Pairing Heaps
    Summary
    Exercises
    References
    Appendix A: Separate Compilation of Class Templates
    A.1 Everything in the Header
    A.2 Explicit Instantiation
    Index
    A
    B
    C
    D
    E
    F
    G
    H
    I
    J
    K
    L
    M
    N
    O
    P
    Q
    R
    S
    T
    U
    V
    W
    X
    Y
    Z
    Fourth Edition Data Structures and Algorithm Analysis inC++
    This page intentionally left blank
    Fourth Edition Data Structures and Algorithm Analysis inC++ M a r k A l l e n W e i s s Florida International University Boston Columbus Indianapolis New York San Francisco Upper Saddle River Amsterdam Cape Town Dubai London Madrid Milan Munich Paris Montreal Toronto Delhi Mexico City Sao Paulo Sydney Hong Kong Seoul Singapore Taipei Tokyo
    Editorial Director, ECS: Marcia Horton Executive Editor: Tracy Johnson Editorial Assistant: Jenah Blitz-Stoehr Director of Marketing: Christy Lesko Marketing Manager: Yez Alayan Senior Marketing Coordinator: Kathryn Ferranti Marketing Assistant: Jon Bryant Director of Production: Erin Gregg Senior Managing Editor: Scott Disanno Senior Production Project Manager: Marilyn Lloyd Manufacturing Buyer: Linda Sager Art Director: Jayne Conte Cover Designer: Bruce Kenselaar Permissions Supervisor: Michael Joyce Permissions Administrator: Jenell Forschler Cover Image: c De-kay | Dreamstime.com Media Project Manager: Renata Butera Full-Service Project Management: Integra Software Services Pvt. Ltd. Composition: Integra Software Services Pvt. Ltd. Text and Cover Printer/Binder: Courier Westford Copyright c 2014, 2006, 1999 Pearson Education, Inc., publishing as Addison-Wesley. All rights reserved. Printed in the United States of America. This publication is protected by Copyright, and permission should be obtained from the publisher prior to any prohibited reproduction, storage in a retrieval system, or transmission in any form or by any means, electronic, mechanical, photocopying, recording, or likewise. To obtain permission(s) to use material from this work, please submit a written request to Pearson Education, Inc., Permissions Department, One Lake Street, Upper Saddle River, New Jersey 07458, or you may fax your request to 201-236-3290. Many of the designations by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in this book, and the publisher was aware of a trademark claim, the designations have been printed in initial caps or all caps. Library of Congress Cataloging-in-Publication Data Weiss, Mark Allen. Data structures and algorithm analysis in C++ / Mark Allen Weiss, Florida International University. — Fourth edition. pages cm ISBN-13: 978-0-13-284737-7 (alk. paper) ISBN-10: 0-13-284737-X (alk. paper) 1. C++ (Computer program language) 2. Data structures (Computer science) 3. Computer algorithms. I. Title. QA76.73.C153W46 2014 005.7 3—dc23 2013011064 10 9 8 7 6 5 4 3 2 1 www.pearsonhighered.com ISBN-10: 0-13-284737-X ISBN-13: 978-0-13-284737-7
    To my kind, brilliant, and inspiring Sara.
    This page intentionally left blank
    CONTENTS Preface xv Chapter 1 Programming: A General Overview 1 1.1 What’s This Book About? 1.2 Mathematics Review 2 3 3 1.2.1 Exponents 1.2.2 Logarithms 1.2.3 Series 1.2.4 Modular Arithmetic 1.2.5 The P Word 6 4 1 5 1.3 A Brief Introduction to Recursion 1.4 C++ Classes 12 8 1.4.1 Basic class Syntax 1.4.2 Extra Constructor Syntax and Accessors 1.4.3 Separation of Interface and Implementation 16 1.4.4 vector and string 12 13 19 1.5 C++ Details 21 21 1.5.1 Pointers 1.5.2 Lvalues, Rvalues, and References 1.5.3 Parameter Passing 1.5.4 Return Passing 1.5.5 std::swap and std::move 1.5.6 The Big-Five: Destructor, Copy Constructor, Move Constructor, Copy 23 25 27 29 Assignment operator=, Move Assignment operator= 30 1.5.7 C-style Arrays and Strings 35 1.6 Templates 36 37 1.6.1 Function Templates 1.6.2 Class Templates 38 1.6.3 Object, Comparable, and an Example 1.6.4 Function Objects 1.6.5 Separate Compilation of Class Templates 41 39 44 1.7 Using Matrices 44 1.7.1 The Data Members, Constructor, and Basic Accessors 1.7.2 operator[] 45 44 vii
    分享到：
    赞 收藏

    相关推荐

    资料库

    课程资源

    共收录17145份资料，累计13个分类，关注成员有19位，主要包括：PHP,网络管理,网页制作,Java,.Net,数据库,3G/移动开发,C/C++,游戏开发,嵌入式,讲义,软件测试,专业指导

    热门标签

    PHP 网络管理 网页制作 Java .Net 数据库 3G/移动开发 C/C++ 游戏开发 嵌入式 讲义 软件测试 专业指导

    最新资料