Buy Textbooks  |  Rent Textbooks  |  Sell Textbooks  |  eTextbooks
Help  |  Questions? 1-877-292-6442
Hello, Sign In
Your Account
0

Introduction to the Analysis of Algorithms - 96 edition

Introduction to the Analysis of Algorithms (ISBN10: 020140009X; ISBN13: 9780201400090)
ISBN13: 978-0201400090
ISBN10: 020140009X

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
...show more
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
...show less

Edition/Copyright: 96
Cover: Hardback
Publisher: Addison-Wesley Longman, Inc.
Year Published: 1996
International: No

View Preface
View Review
View Table of Contents



List Price: $64.99
Used $6.52
Used
Save $58.47 (90%)
  • FREE shipping over $25
  • In stock
  • 30-day returns
Condition:
Order this book in the next 19 hours and 42 minutes and it ships by Noon CT Monday!
New  Currently Sold Out
Close
Close
Close