Introduction to the Design and Analysis of Algorithms

ISBN-10: 0321358287
ISBN-13: 9780321358288
Edition: 2nd 2007 (Revised)
Authors: Anany V. Levitin
List price: $122.00
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

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
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS PowerPoint® 2010 Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $122.00
Edition: 2nd
Copyright year: 2007
Publisher: Addison-Wesley Longman, Incorporated
Publication date: 2/14/2006
Binding: Paperback
Pages: 592
Size: 7.50" wide x 9.25" long x 1.00" tall
Weight: 2.222
Language: English

Preface
Introduction
The notion of algorithm
Fundamentals of algorithmic problem solving
Important problem types
Fundamental data structures
Fundamentals of the Analysis of Algorithm Efficiency
Analysis framework
Asymptotic notations and standard efficiency classes
Mathematical analysis of nonrecursive algorithms
Mathematical analysis of recursive algorithms
Example: Fibonacci numbers
Empirical analysis of algorithms
Algorithm visualization
Brute Force
Selection sort and bubble sort
Sequential search and brute-force string matching
The closest-pair and convex-hull problems by brute force
Exhaustive search
Divide-and-Conquer
Mergesort
Quicksort
Binary search
Binary tree traversals and related properties
Multiplication of large integers and Strassen's matrix multiplication
Closest-pair and convex-hull problems by divide-and-conquer
Decrease-and-Conquer
Insertion sort
Depth-first search and breadth-first search
Topological sorting
Algorithms for generating combinatorial objects
Decrease-by-a-constant-factor algorithms
Variable-size-decrease algorithms
Transform-and-conquer
Presorting
Gaussian elimination
Balanced search trees
Heaps and heapsort
Horner's rule and binary exponentiation
Problem reduction
Space and Time Tradeoffs
Sorting by counting
Horspool's and Boyer-Moore algorithms for string matching
Hashing
B-trees
Dynamic Programming
Computing a binomial coefficient
Shortest-path problems
Warshall's and Floyd's algorithms
Optimal binary search trees
The knapsack problem and memory functions
Greedy Technique
Prim's algorithm
Kruskal's algorithm
Dijkstra's algorithm
Huffman trees
Limitations of Algorithm Power
Lower-bound arguments
Decision trees
P, NP, and NP-complete problems
Challenges of numerical algorithms
Coping with the Limitations of Algorithm Power
Backtracking
Branch-and-bound
Approximation algorithms for NP-hard problems
Algorithms for solving nonlinear equations
Epilogue
Useful Formulas for the Analysis of Algorithms
Short Tutorial on Recurrence Relations
Bibliography
Hints to Exercises
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.

×