Home > Store

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

Register your product to gain access to bonus material or receive a coupon.

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


  • Your Price: $152.99
  • List Price: $179.99
  • Usually ships in 24 hours.



  • This text is designed to teach students good programming and algorithm analysis skills simultaneously so that they can develop intricate programs with the maximum amount of efficiency.
  • By analyzing an algorithm before it is actually coded, students can decide if a particular solution will be feasible and see how careful implementations can reduce the time constraint for large amounts of data. No algorithm or data structure is presented without an explanation of its running time.
  • This book is suitable for either an advanced data structures (CS7) course or a first-year graduate course in algorithm analysis. As introductory sequences expand from two to three courses, this book is ideal at the end of the third course, bridging the way to the Algorithms course.
  • Discussion of algorithm and design techniques covers greedy algorithms, divide and conquer algorithms, dynamic programming, randomized algorithms, and backtracking.
  • Covers topics and data structures such as Fibonacci heaps, skew heaps, binomial queue, skip lists and splay trees.
  • A full chapter on amortized analysis examines the advanced data structures presented earlier in the book.
  • Chapter on advanced data structures and their implementation covers red black trees, top down splay trees, k-d trees, pairing heaps, and more.
  • End-of-chapter exercises, ranked by difficulty, reinforce the material from the chapter while providing readers an opportunity to put those concepts into practice.


  • Copyright 2014
  • Dimensions: 7-3/8" x 9-1/8"
  • Pages: 664
  • Edition: 4th
  • Book
  • ISBN-10: 0-13-284737-X
  • ISBN-13: 978-0-13-284737-7

Data Structures and Algorithm Analysis in C++ is an advanced algorithms book that bridges the gap between traditional CS2 and Algorithms Analysis courses.

As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs using the C++ programming language.

This book explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm.

Sample Content

Table of Contents

Chapter 1 Programming: A General Overview 1

1.1 What’s This Book About? 1

1.2 Mathematics Review 2

1.2.1 Exponents 3

1.2.2 Logarithms 3

1.2.3 Series 4

1.2.4 Modular Arithmetic 5

1.2.5 The P Word 6

1.3 A Brief Introduction to Recursion 8

1.4 C++ Classes 12

1.4.1 Basic class Syntax 12

1.4.2 Extra Constructor Syntax and Accessors 13

1.4.3 Separation of Interface and Implementation 16

1.4.4 vector and string 19

1.5 C++ Details 21

1.5.1 Pointers 21

1.5.2 Lvalues, Rvalues, and References 23

1.5.3 Parameter Passing 25

1.5.4 Return Passing 27

1.5.5 std::swap and std::move 29

1.5.6 The Big-Five: Destructor, Copy Constructor, Move Constructor, Copy Assignment operator=, Move Assignment operator= 30

1.5.7 C-style Arrays and Strings 35

1.6 Templates 36

1.6.1 Function Templates 37

1.6.2 Class Templates 38

1.6.3 Object, Comparable, and an Example 39

1.6.4 Function Objects 41

1.6.5 Separate Compilation of Class Templates 44

1.7 Using Matrices 44

1.7.1 The Data Members, Constructor, and Basic Accessors 44

1.7.2 operator[] 45

1.7.3 Big-Five 46

Summary 46

Exercises 46

References 48

Chapter 2 Algorithm Analysis 51

2.1 Mathematical Background 51

2.2 Model 54

2.3 What to Analyze 54

2.4 Running-Time Calculations 57

2.4.1 A Simple Example 58

2.4.2 General Rules 58

2.4.3 Solutions for the Maximum Subsequence Sum Problem 60

2.4.4 Logarithms in the Running Time 66

2.4.5 Limitations of Worst Case Analysis 70

Summary 70

Exercises 71

References 76

Chapter 3 Lists, Stacks, and Queues 77

3.1 Abstract Data Types (ADTs) 77

3.2 The List ADT 78

3.2.1 Simple Array Implementation of Lists 78

3.2.2 Simple Linked Lists 79

3.3 vector and list in the STL 80

3.3.1 Iterators 82

3.3.2 Example: Using erase on a List 83

3.3.3 const_iterators 84

3.4 Implementation of vector 86

3.5 Implementation of list 91

3.6 The Stack ADT 103

3.6.1 Stack Model 103

3.6.2 Implementation of Stacks 104

3.6.3 Applications 104

3.7 The Queue ADT 112

3.7.1 Queue Model 113

3.7.2 Array Implementation of Queues 113

3.7.3 Applications of Queues 115

Summary 116

Exercises 116

Chapter 4 Trees 121

4.1 Preliminaries 121

4.1.1 Implementation of Trees 122

4.1.2 Tree Traversals with an Application 123

4.2 Binary Trees 126

4.2.1 Implementation 128

4.2.2 An Example: Expression Trees 128

4.3 The Search Tree ADT–Binary Search Trees 132

4.3.1 contains 134

4.3.2 findMin and findMax 135

4.3.3 insert 136

4.3.4 remove 139

4.3.5 Destructor and Copy Constructor 141

4.3.6 Average-Case Analysis 141

4.4 AVL Trees 144

4.4.1 Single Rotation 147

4.4.2 Double Rotation 149

4.5 Splay Trees 158

4.5.1 A Simple Idea (That Does Not Work) 158

4.5.2 Splaying 160

4.6 Tree Traversals (Revisited) 166

4.7 B-Trees 168

4.8 Sets and Maps in the Standard Library 173

4.8.1 Sets 173

4.8.2 Maps 174

4.8.3 Implementation of set and map 175

4.8.4 An Example That Uses Several Maps 176

Summary 181

Exercises 182

References 189

Chapter 5 Hashing 193

5.1 General Idea 193

5.2 Hash Function 194

5.3 Separate Chaining 196

5.4 Hash Tables without Linked Lists 201

5.4.1 Linear Probing 201

5.4.2 Quadratic Probing 202

5.4.3 Double Hashing 207

5.5 Rehashing 208

5.6 Hash Tables in the Standard Library 210

5.7 Hash Tables with Worst-Case O(1) Access 212

5.7.1 Perfect Hashing 213

5.7.2 Cuckoo Hashing 215

5.7.3 Hopscotch Hashing 224

5.8 Universal Hashing 230

5.9 Extendible Hashing 233

Summary 236

Exercises 238

References 242

Chapter 6 Priority Queues (Heaps) 245

6.1 Model 245

6.2 Simple Implementations 246

6.3 Binary Heap 247

6.3.1 Structure Property 247

6.3.2 Heap-Order Property 248

6.3.3 Basic Heap Operations 249

6.3.4 Other Heap Operations 252

6.4 Applications of Priority Queues 257

6.4.1 The Selection Problem 258

6.4.2 Event Simulation 259

6.5 d-Heaps 260

6.6 Leftist Heaps 261

6.6.1 Leftist Heap Property 261

6.6.2 Leftist Heap Operations 262

6.7 Skew Heaps 269

6.8 Binomial Queues 271

6.8.1 Binomial Queue Structure 271

6.8.2 Binomial Queue Operations 271

6.8.3 Implementation of Binomial Queues 276

6.9 Priority Queues in the Standard Library 283

Summary 283

Exercises 283

References 288

Chapter 7 Sorting 291

7.1 Preliminaries 291

7.2 Insertion Sort 292

7.2.1 The Algorithm 292

7.2.2 STL Implementation of Insertion Sort 293

7.2.3 Analysis of Insertion Sort 294

7.3 A Lower Bound for Simple Sorting Algorithms 295

7.4 Shellsort 296

7.4.1 Worst-Case Analysis of Shellsort 297

7.5 Heapsort 300

7.5.1 Analysis of Heapsort 301

7.6 Mergesort 304

7.6.1 Analysis of Mergesort 306

7.7 Quicksort 309

7.7.1 Picking the Pivot 311

7.7.2 Partitioning Strategy 313

7.7.3 Small Arrays 315

7.7.4 Actual Quicksort Routines 315

7.7.5 Analysis of Quicksort 318

7.7.6 A Linear-Expected-Time Algorithm for Selection 321

7.8 A General Lower Bound for Sorting 323

7.8.1 Decision Trees 323

7.9 Decision-Tree Lower Bounds for Selection Problems 325

7.10 Adversary Lower Bounds 328

7.11 Linear-Time Sorts: Bucket Sort and Radix Sort 331

7.12 External Sorting 336

7.12.1 Why We Need New Algorithms 336

7.12.2 Model for External Sorting 336

7.12.3 The Simple Algorithm 337

7.12.4 Multiway Merge 338

7.12.5 Polyphase Merge 339

7.12.6 Replacement Selection 340

Summary 341

Exercises 341

References 347

Chapter 8 The Disjoint Sets Class 351

8.1 Equivalence Relations 351

8.2 The Dynamic Equivalence Problem 352

8.3 Basic Data Structure 353

8.4 Smart Union Algorithms 357

8.5 Path Compression 360

8.6 Worst Case for Union-by-Rank and Path Compression 361

8.6.1 Slowly Growing Functions 362

8.6.2 An Analysis by Recursive Decomposition 362

8.6.3 An O( M log *N ) Bound 369

8.6.4 An O( M α(M, N) ) Bound 370

8.7 An Application 372

Summary 374

Exercises 375

References 376

Chapter 9 Graph Algorithms 379

9.1 Definitions 379

9.1.1 Representation of Graphs 380

9.2 Topological Sort 382

9.3 Shortest-Path Algorithms 386

9.3.1 Unweighted Shortest Paths 387

9.3.2 Dijkstra’s Algorithm 391

9.3.3 Graphs with Negative Edge Costs 400

9.3.4 Acyclic Graphs 400

9.3.5 All-Pairs Shortest Path 404

9.3.6 Shortest Path Example 404

9.4 Network Flow Problems 406

9.4.1 A Simple Maximum-Flow Algorithm 408

9.5 Minimum Spanning Tree 413

9.5.1 Prim’s Algorithm 414

9.5.2 Kruskal’s Algorithm 417

9.6 Applications of Depth-First Search 419

9.6.1 Undirected Graphs 420

9.6.2 Biconnectivity 421

9.6.3 Euler Circuits 425

9.6.4 Directed Graphs 429

9.6.5 Finding Strong Components 431

9.7 Introduction to NP-Completeness 432

9.7.1 Easy vs. Hard 433

9.7.2 The Class NP 434

9.7.3 NP-Complete Problems 434

Summary 437

Exercises 437

References 445

Chapter 10 Algorithm Design Techniques 449

10.1 Greedy Algorithms 449

10.1.1 A Simple Scheduling Problem 450

10.1.2 Huffman Codes 453

10.1.3 Approximate Bin Packing 459

10.2 Divide and Conquer 467

10.2.1 Running Time of Divide-and-Conquer Algorithms 468

10.2.2 Closest-Points Problem 470

10.2.3 The Selection Problem 475

10.2.4 Theoretical Improvements for Arithmetic Problems 478

10.3 Dynamic Programming 482

10.3.1 Using a Table Instead of Recursion 483

10.3.2 Ordering Matrix Multiplications 485

10.3.3 Optimal Binary Search Tree 487

10.3.4 All-Pairs Shortest Path 491

10.4 Randomized Algorithms 494

10.4.1 Random-Number Generators 495

10.4.2 Skip Lists 500

10.4.3 Primality Testing 503

10.5 Backtracking Algorithms 506

10.5.1 The Turnpike Reconstruction Problem 506

10.5.2 Games 511

Summary 518

Exercises 518

References 527

Chapter 11 Amortized Analysis 533

11.1 An Unrelated Puzzle 534

11.2 Binomial Queues 534

11.3 Skew Heaps 539

11.4 Fibonacci Heaps 541

11.4.1 Cutting Nodes in Leftist Heaps 542

11.4.2 Lazy Merging for Binomial Queues 544

11.4.3 The Fibonacci Heap Operations 548

11.4.4 Proof of the Time Bound 549

11.5 Splay Trees 551

Summary 555

Exercises 556

References 557

Chapter 12 Advanced Data Structures and Implementation 559

12.1 Top-Down Splay Trees 559

12.2 Red-Black Trees 566

12.2.1 Bottom-Up Insertion 567

12.2.2 Top-Down Red-Black Trees 568

12.2.3 Top-Down Deletion 570

12.3 Treaps 576

12.4 Suffix Arrays and Suffix Trees 579

12.4.1 Suffix Arrays 580

12.4.2 Suffix Trees 583

12.4.3 Linear-Time Construction of Suffix Arrays and Suffix Trees 586

12.5 k-d Trees 596

12.6 Pairing Heaps 602

Summary 606

Exercises 608

References 612

Appendix A Separate Compilation of Class Templates 615

A.1 Everything in the Header 616

A.2 Explicit Instantiation 616

Index 619


Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020