25 Women to Read Before You Die

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores

    Recently Viewed clear list

    Interviews | August 31, 2015

    Shawn Donley: IMG Bill Clegg: The Powells.com Interview

    Bill CleggIn January of this year, eight months before its release date, the buzz was already starting to build for Bill Clegg's Did You Ever Have a Family.... Continue »
    1. $18.20 Sale Hardcover add to wish list

      Did You Ever Have a Family

      Bill Clegg 9781476798172

Qualifying orders ship free.
List price: $169.70
Used Hardcover
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
17 Partner Warehouse Mathematics- Advanced

Introduction To Algorithms (Cloth) - With CD (2ND 01 Edition)


Introduction To Algorithms (Cloth) - With CD (2ND 01 Edition) Cover


Synopses & Reviews

Please note that used books may not include additional media (study guides, CDs, DVDs, solutions manuals, etc.) as described in the publisher comments.

Publisher Comments:

The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects.

In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage.

As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds.

Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.

Table of Contents


I Foundations

1 The Role of Algorithms in Computing

2 Getting Started

3 Growth of Functions

4 Recurrences

5 Probabilistic Analysis and Randomized Algorithms

II Sorting and Order Statistics

6 Heapsort

7 Quicksort

8 Sorting in Linear Time

9 Medians and Order Statistics

III Data Structures

10 Elementary Data Structures

11 Hash Table

12 Binary Search Trees

13 Red-Black Trees

14 Augmenting Data Structures

IV Advanced Design and Analysis Techniques

15 Dynamic Programming

16 Greedy Algorithms

17 Amortized Analysis

V Advanced Data Structures

18 B-Trees

19 Binomial Heaps

20 Fibonacci Heaps

21 Data Structures for Disjoint Sets

VI Graph Algorithms

22 Elementary Graph Algorithms

23 Minimum Spanning Trees

24 Single-Source Shortest Paths

25 All-Pairs Shortest Paths

26 Maximum Flow

VII Selected Topics

27 Sorting Networks

28 Matrix Operations

29 Linear Programming

30 Polynomials and the FFT

31 Number-Theoretic Algorithms

32 String Matching

33 Computational Geometry

34 NP-Completeness

35 Approximation Algorithms

VIII Appendix: Mathematical Background

A Summations

B Sets, Etc.

C Counting and Probability


Index (created by the authors)

Product Details

Cormen, Thomas H.
McGraw-Hill Science/Engineering/Math
Leiserson, Charles E.
Cormen, Thomas
Stein, Clifford
Rivest, Ronald L.
Programming - Algorithms
Software Engineering-Algorithms
Edition Number:
Publication Date:
December 2003
Grade Level:
College/higher education:
9.31x8.16x1.90 in. 4.61 lbs.

Related Subjects

Computers and Internet » Software Engineering » Algorithms
Science and Mathematics » Mathematics » Advanced

Introduction To Algorithms (Cloth) - With CD (2ND 01 Edition) Used Hardcover
0 stars - 0 reviews
$113.00 In Stock
Product details 1056 pages McGraw-Hill Science/Engineering/Math - English 9780072970548 Reviews:
  • back to top


Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.