EVERYDAY FREE SHIPPING on $25 & up - Excludes marketplace items & rentals.
EVERYDAY FREE SHIPPING on $25 & up - Excludes marketplace items & rentals.
EVERYDAY FREE SHIPPING on $25 & up - Excludes marketplace items & rentals
Search
Introduction to the Analysis of Algorithms

Introduction to the Analysis of Algorithms - 96 edition

ISBN13: 978-0201400090

Cover of Introduction to the Analysis of Algorithms 96 (ISBN 978-0201400090)
ISBN13: 978-0201400090
ISBN10: 020140009X
Cover type: Hardback
Edition/Copyright: 96
Publisher: Addison-Wesley Longman, Inc.
Published: 1996
International: No

List price: $64.99

new
Sold Out
FREE Shipping on $25+
  • Check back soon!
  • 30-Day Returns
  • Condition: New
Sold Out
More Shipping Options

Introduction to the Analysis of Algorithms - 96 edition

ISBN13: 978-0201400090

Robert Sedgewick

ISBN13: 978-0201400090
ISBN10: 020140009X
Cover type: Hardback
Edition/Copyright: 96
Publisher: Addison-Wesley Longman, Inc.

Published: 1996
International: No
Summary

This book provides a thorough introduction to the primary techniques used in the mathematical analysis of algorithms. The authors draw from classical mathematical material, including discrete mathematics, elementary real analysis, and combinatorics, as well as from classical computer science material, including algorithms and data structures. They focus on "average-case" or "probabilistic" analysis, although they also cover the basic mathematical tools required for "worst-case" or "complexity" analysis. Topics include recurrences, generating functions, asymptotics, trees, strings, maps, and an analysis of sorting, tree search, string search, and hashing algorithms.

Despite the large interest in the mathematical analysis of algorithms, basic information on methods and models in widespread use has not been directly accessible for work or study in the field. The authors here address this need, combining a body of material that gives the reader both an appreciation for the challenges of the field and the requisite background for keeping abreast of the new research being done to meet these challenges.

Highlights :

  • Thorough, self-contained coverage for students and professionals in computer science and mathematics
  • Focus on mathematical techniques of analysis
  • Basic preparation for the advanced results covered in Knuth's books and the research literature
  • Classical approaches and results in the analysis of algorithms

Table of Contents

Analysis of Algorithms.
Recurrence Relations.
Generating Functions.
Asymptotic Approximations.
Trees.
Permutations.
Strings and Tries.
Words and Maps.

More Shipping Options