Introduction to Algorithms and Java CD-ROM / Edition 2

Hardcover (Print)
Buy New
Buy New from BN.com
$122.42
Buy Used
Buy Used from BN.com
$93.21
(Save 39%)
Item is in good condition but packaging may have signs of shelf wear/aging or torn packaging.
Condition: Used – Good details
Used and New from Other Sellers
Used and New from Other Sellers
from $27.15
Usually ships in 1-2 business days
(Save 82%)
Other sellers (Hardcover)
  • All (4) from $27.15   
  • New (1) from $115.00   
  • Used (3) from $27.15   

More About This Textbook

Overview

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.

Read More Show Less

Product Details

  • ISBN-13: 9780072970548
  • Publisher: McGraw-Hill Companies, The
  • Publication date: 12/16/2003
  • Edition description: New Edition
  • Edition number: 2
  • Pages: 1056
  • Product dimensions: 8.20 (w) x 9.30 (h) x 1.90 (d)

Table of Contents

Preface
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

Bibliography

Index (created by the authors)
Read More Show Less

Customer Reviews

Average Rating 4.5
( 2 )
Rating Distribution

5 Star

(1)

4 Star

(1)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing all of 2 Customer Reviews
  • Posted January 3, 2011

    Good, used product, excellent on-time service from Woody's books

    I ordered this rather late but it was still delivered in time for Christmas as a gift. I'd recommend dealing with Woody's books with complete confidence.

    Was this review helpful? Yes  No   Report this review
  • Anonymous

    Posted November 9, 2009

    No text was provided for this review.

Sort by: Showing all of 2 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)