Algorithms in C++

  • ISBN13:


  • ISBN10:


  • Edition: 3rd
  • Format: Hardcover
  • Copyright: 2018-06-22
  • Publisher: Addison-Wesley

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $79.99 Save up to $20.00
  • Rent Book $59.99
    Add to Cart Free Shipping


Supplemental Materials

What is included with this book?

  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
  • The Rental copy of this book is not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.


Continuation of Parts 1-4 in C++. Part 5 focuses exclusively on Graph Algorithms, and will make a neat bundle with Parts 1-4 for a jr/sr undergrad course.

Table of Contents

Introductionp. 3
C++ (and C)p. 7
Elementary Data Structuresp. 15
Treesp. 35
Recursionp. 51
Analysis of Algorithmsp. 67
Implementation of Algorithmsp. 81
Sorting Algorithms
Elementary Sorting Methodsp. 93
Quicksortp. 115
Radix Sortingp. 133
Priority Queuesp. 145
Mergesortp. 163
External Sortingp. 177
Searching Algorithms
Elementary Searching Methodsp. 193
Balanced Treesp. 215
Hashingp. 231
Radix Searchingp. 245
External Searchingp. 259
String Processing
String Searchingp. 277
Pattern Matchingp. 293
Parsingp. 305
File Compressionp. 319
Cryptologyp. 333
Geometric Algorithms
Elementary Geometric Methodsp. 347
Finding the Convex Hullp. 359
Range Searchingp. 373
Geometric Intersectionp. 389
Closest-Point Problemsp. 401
Graph Algorithms
Elementary Graph Algorithmsp. 415
Connectivityp. 437
Weighted Graphsp. 451
Directed Graphsp. 471
Network Flowp. 485
Matchingp. 495
Mathematical Algorithms
Random Numbersp. 509
Arithmeticp. 521
Gaussian Eliminationp. 535
Curve Fittingp. 545
Integrationp. 555
Advanced Topics
Parallel Algorithmsp. 569
The Fast Fourier Transformp. 583
Dynamic Programmingp. 595
Linear Programmingp. 607
Exhaustive Searchp. 621
NP-Complete Problemsp. 633
Indexp. 643
Table of Contents provided by Blackwell. All Rights Reserved.

Rewards Program

Write a Review