Computer Algorithms Introduction to Design and Analysis

ISBN-10: 0201612445
ISBN-13: 9780201612448
Edition: 3rd 2000 (Revised)
List price: $164.40 Buy it from $23.08
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description: Drawing upon combined decades of teaching experience, Professors Sara Baase and Allen Van Gelder have extensively revised this best seller to make it the most current and accessible choice for any algorithms course. The new Third Edition features  More...

Used Starting from $98.53
New Starting from $145.80
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
History of Western Art Online content $4.95 $1.99
Add to cart
Study Briefs
History of World Philosophies Online content $4.95 $1.99
Add to cart
Study Briefs
American History Volume 1 Online content $4.95 $1.99
Add to cart
Study Briefs
History of Western Music Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $164.40
Edition: 3rd
Copyright year: 2000
Publisher: Addison Wesley
Publication date: 11/5/1999
Binding: Paperback
Pages: 688
Size: 8.00" wide x 9.75" long x 1.25" tall
Weight: 2.794
Language: English

Drawing upon combined decades of teaching experience, Professors Sara Baase and Allen Van Gelder have extensively revised this best seller to make it the most current and accessible choice for any algorithms course. The new Third Edition features the addition of new topics and exercises and an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms. It continues the tradition of solid mathematical analysis and clear writing style that made it so popular in previous editions.

"Sara Baase" is Professor Emeritus with the Department of Computer Science, San Diego State University, where she won awards for outstanding teaching. Her textbooks in computer science have been translated into several languages. Dr. Baase received her doctoral degree from the University of California, Berkeley.

Preface
Analyzing Algorithms and Problems: Principles and Examples
Introduction
Java as an Algorithm Language
Mathematical Background
Analyzing Algorithms and Problems
Classifying Functions by Their Asymptotic Growth Rates
Searching an Ordered Array
Exercises
Notes and References
Data Abstraction and Basic Data Structures
Introduction
ADT Specification and Design Techniques
Elementary ADTs--Lists and Trees
Stacks and Queues
ADTs for Dynamic Sets
Exercises
Notes and References
Recursion and Induction
Introduction
Recursive Procedures
What Is a Proof?
Induction Proofs
Proving Correctness of Procedures
Recurrence Equations
Recursion Trees
Exercises
Notes and References
Sorting
Introduction
Insertion Sort
Divide and Conquer
Quicksort
Merging Sorted Sequences
Mergesort
Lower Bounds for Sorting by Comparison of Keys
Heapsort
Comparison of Four Sorting Algorithms
Shellsort
Radix Sorting
Exercises
Programs
Notes and References
Selection and Adversary Arguments
Introduction
Finding max and min
Finding the Second-Largest Key
The Selection Problem
A Lower Bound for Finding the Median
Designing Against an Adversary
Exercises
Notes and References
Dynamic Sets and Searching
Introduction
Array Doubling
Amortized Time Analysis
Red-Black Trees
Hashing
Dynamic Equivalence Relations and Union-Find Programs
Priority Queues with a Decrease Key Operation
Exercises
Programs
Notes and References
Graphs and Graph Traversals
Introduction
Definitions and Representations
Traversing Graphs
Depth-First Search on Directed Graphs
Strongly Connected Components of a Directed Graph
Depth-First Search on Undirected Graphs
Biconnected Components of an Undirected Graph
Exercises
Programs
Notes and References
Graph Optimization Problems and Greedy Algorithms
Introduction
Prim's Minimum Spanning Tree Algorithm
Single-Source Shortest Paths
Kruskal's Minimum Spanning Tree Algorithm
Exercises
Programs
Notes and References
Transitive Closure, All-Pairs Shortest Paths
Introduction
The Transitive Closure of a Binary Relation
Warshall's Algorithm for Transitive Closure
All-Pairs Shortest Paths in Graphs
Computing Transitive Closure by Matrix Operations
Multiplying Bit Matrices--Kronrod's Algorithm
Exercises
Programs
Notes and References
Dynamic Programming
Introduction
Subproblem Graphs and Their Traversal
Multiplying a Sequence of Matrices
Constructing Optimal Binary Search Trees
Separating Sequences of Words into Lines
Developing a Dynamic Programming Algorithm
Exercises
Programs
Notes and References
String Matching
Introduction
A Straightforward Solution
The Knuth-Morris-Pratt Algorithm
The Boyer-Moore Algorithm
Approximate String Matching
Exercises
Programs
Notes and References
Polynomials and Matrices
Introduction
Evaluating Polynomial Functions
Vector and Matrix Multiplication
The Fast Fourier Transform and Convolution
Exercises
Programs
Notes and References
NP-Complete Problems
Introduction
P and NP
NP-Complete Problems
Approximation Algorithms
Bin Packing
The Knapsack and Subset Sum Problems
Graph Coloring
The Traveling Salesperson Problem
Computing with DNA
Exercises
Notes and References
Parallel Algorithms
Introduction
Parallelism, the PRAM, and Other Models
Some Simple PRAM Algorithms
Handling Write Conflicts
Merging and Sorting
Finding Connected Components
A Lower Bound for Adding n Integers
Exercises
Notes and References
Java Examples and Techniques
Introduction
A Java Main Program
A Simple Input Library
Documenting Java Classes
Generic Order and the "Comparable" Interface
Subclasses Extend the Capability of Their Superclass
Copy via the "Cloneable" Interface
Bibliography
Index

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×