Introduction to the Analysis of Algorithms
Edition: 2nd 2013
List price: $79.99
Buy it from $74.04
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: Despite growing interest in the mathematical analysis of algorithms, basic information on methods and models has rarely been directly accessible to practitioners, researchers, or students. This book organizes and presents that knowledge, fully introducing today's primary techniques for mathematically analyzing algorithms. Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematical and computer science material, integrating discrete mathematics, elementary real analysis, combinatorics, algorithms, and data structures. They focus on "average-case" or "probabilistic" analysis, while also covering tools for "worst case" or "complexity" analysis. Improvements in this edition include: * Upgraded figures and code* Newer style for presenting much of the text's math* An all-new chapter on trees This book's thorough, self-contained coverage will help readers appreciate the field's challenges, prepare them for advanced results covered in Donald Knuth's books, and provide the background they need to keep abreast of new research. Coverage includes: recurrences, generating functions, asymptotics, trees, strings, maps, sorting, tree search, string search, and hashing algorithms. Ideal for junior- or senior-level courses on mathematical analysis of algorithms, this book will also be useful in courses on discrete mathematics for computer scientists, and in introducing mathematics students to computer science principles related to algorithms and data structures.
Rush Rewards U
You have reached 400 XP and carrot coins. That is the daily max!
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.
List price: $79.99
Copyright year: 2013
Publisher: Addison Wesley Professional
Publication date: 1/18/2013
Size: 7.75" wide x 9.25" long x 1.50" tall