Programming Books C Java PHP Python Learn more Browse Programming Books
Qty:1
  • List Price: $64.99
  • Save: $9.82 (15%)
Only 2 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Condition: Used: Good
Comment: SHIPS DIRECTLY FROM AMAZON! Eligible for FREE Super Saver Shipping and PRIME. Tracking is included. Easy return policy. Text appears clean. Tight binding. Moderate wear. No disc, access code or other accessories.
Access codes and supplements are not guaranteed with used items.
Sell yours for a Gift Card
We'll buy it for $2.00
Learn More
Trade in now
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

An Introduction to the Analysis of Algorithms Paperback – December 10, 1995

ISBN-13: 978-0201400090 ISBN-10: 020140009X Edition: 1st

Buy New
Price: $55.17
16 New from $26.46 24 Used from $4.35 1 Collectible from $112.22
Amazon Price New from Used from
Hardcover
"Please retry"
$50.00
Paperback
"Please retry"
$55.17
$26.46 $4.35

There is a newer edition of this item:

Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Frequently Bought Together

An Introduction to the Analysis of Algorithms + Analytic Combinatorics + Algorithms (4th Edition)
Price for all three: $213.44

Buy the selected items together
NO_CONTENT_IN_FEATURE

Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

Product Details

  • Paperback: 512 pages
  • Publisher: Addison-Wesley Professional; 1 edition (December 10, 1995)
  • Language: English
  • ISBN-10: 020140009X
  • ISBN-13: 978-0201400090
  • Product Dimensions: 6 x 1.3 x 8.9 inches
  • Shipping Weight: 1.5 pounds (View shipping rates and policies)
  • Average Customer Review: 4.7 out of 5 stars  See all reviews (6 customer reviews)
  • Amazon Best Sellers Rank: #1,391,040 in Books (See Top 100 in Books)

Editorial Reviews

From the Inside Flap

This book is intended to be a thorough overview of the primary techniques used in the mathematical analysis of algorithms. The material covered draws from classical mathematical topics, including discrete mathematics, elementary real analysis, and combinatorics; as well as from classical computer science topics, including algorithms and data structures. The focus is on "average-case'' or "probabilistic'' analysis, though the basic mathematical tools required for "worst-case" or "complexity" analysis are covered, as well.

It is assumed that the reader has some familiarity with basic concepts in both computer science and real analysis. In a nutshell, the reader should be able to both write programs and prove theorems; otherwise, the book is intended to be self-contained. Ample references to preparatory material in the literature are also provided. A planned companion volume will cover more advanced techniques. Together, the books are intended to cover the main techniques and to provide access to the growing research literature on the analysis of algorithms.

The book is meant to be used as a textbook in a junior- or senior-level course on "Mathematical Analysis of Algorithms.'' It might also be useful in a course in discrete mathematics for computer scientists, since it covers basic techniques in discrete mathematics as well as combinatorics and basic properties of important discrete structures within a familiar context for computer science students. It is traditional to have somewhat broader coverage in such courses, but many instructors may find the approach here a useful way to engage students in a substantial portion of the material. The book also can be used to introduce students in mathematics and applied mathematics to principles from computer science related to algorithms and data structures.

Supplemented by papers from the literature, the book can serve as the basis for an introductory graduate course on the analysis of algorithms, or as a reference or basis for self-study by researchers in mathematics or computer science who want access to the literature in this field. It also might be of use to students and researchers in combinatorics and discrete mathematics, as a source of applications and techniques.

Despite the large literature on the mathematical analysis of algorithms, basic information on methods and models in widespread use has not been directly accessible to students and researchers in the field. This book aims to address this situation, bringing together a body of material intended to provide the reader with both an appreciation for the challenges of the field and the requisite background for learning the advanced tools being developed to meet these challenges.Preparation

Mathematical maturity equivalent to one or two years' study at the college level is assumed. Basic courses in combinatorics and discrete mathematics may provide useful background (and may overlap with some material in the book), as would courses in real analysis, numerical methods, or elementary number theory. We draw on all of these areas, but summarize the necessary material here, with reference to standard texts for people who want more information.

Programming experience equivalent to one or two semesters' study at the college level, including elementary data structures, is assumed. We do not dwell on programming and implementation issues, but algorithms and data structures are the central object of our studies. Again, our treatment is complete in the sense that we summarize basic information, with reference to standard texts and primary sources.

Access to a computer system for mathematical manipulation such as MAPLE or Mathematica is highly recommended. These systems can relieve one from tedious calculations, when checking material in the text or solving exercises.Related books

Related texts include "The Art of Computer Programming" by Knuth; "Handbook of Algorithms and Data Structure" by Gonnet and Baeza-Yates; "Algorithms"by Sedgewick; "Concrete Mathematics" by Graham, Knuth and Patashnik; and "Introduction to Algorithms" by Cormen, Leiserson, and Rivest. This book could be considered supplementary to each of these, as examined below, in turn.

In spirit, this book is closest to the pioneering books by Knuth, but our focus is on mathematical techniques of analysis, where those books are broad and encyclopaedic in scope with properties of algorithms playing a primary role and methods of analysis a secondary role. This book can serve as basic preparation for the advanced results covered and referred to in Knuth's books.

We also cover approaches and results in the analysis of algorithms that have been developed sincepublication of Knuth's books. The book by Gonnet and Baeza-Yates is a thorough survey of such results, including a comprehensive bibliography. That book primarily presents results with reference to derivations in the literature. Again, this book provides the basic preparation for access to this literature.

We also strive to keep the focus on covering algorithms of fundamental importance and interest, such as those described in Sedgewick, where Graham, Knuth, and Patashnik focus almost entirely on mathematical techniques. This book is intended to bea link between the basic mathematical techniques discussed in Knuth, Graham, and Patashnik and the basic algorithms covered in Sedgewick.

The book by Cormen, Leiserson, and Rivest is representative of a number of books that provide access to the research literature on "design and analysis'' of algorithms, which is normally based on rough worst-case estimates of performance. When more precise results are desired (presumably for the most important methods), more sophisticated models and mathematical tools are required. This book is supplementary to books like Cormen, Leiserson and Rivest in that they focus on design of algorithms (usually with the goal of bounding worst-case performance), with analytic results used to help guide the design, where we focus on the analysis of algorithms, especially on techniques that can be used to develop detailed results that could be used to predict performance. In this process, we also consider relationships to various classical mathematical tools. Chapter 1 is devoted entirely to developing this context.

This book also lays the groundwork for a companion volume, "Analytic Combinatorics", a general treatment that places the material in this book into a broader perspective and develops advanced methods and models that can serveas the basis for new research, not only in average-case analysis of algorithms, but also in combinatorics. A higher level of mathematical maturity is assumed for that volume, perhaps at the senior or beginning graduate student level. Of course, careful study of this book is adequate preparation. It certainly has been our goal to make the present volume sufficiently interesting that some readers will be inspired to tackle more advanced material! How to use this book

Readers of this book are likely to have rather diverse backgrounds in discrete mathematics and computer science. With this in mind, it is useful to be aware the basic structure of book: There are eight chapters, an introduction followed by three chapters that emphasize mathematical methods, then four chapters that emphasize applications in the analysis of algorithms, as shown in the following outline:IntroductionAnalysis of AlgorithmsDiscrete Mathematical MethodsRecurrencesGenerating FunctionsAsymptotic AnalysisAlgorithms and Combinatorial StructuresTreesPermutationsStrings and TriesWords and Maps

Chapter 1 puts the material in the book into perspective, and will help all readers understand the basic objectives of the book and the role of the remaining chapters in meeting those objectives. Chapters 2-4 are more oriented towards mathematics, as they cover methods from discrete mathematics, primarily focused on developing basic concepts and techniques. Chapters 5-8 are more oriented towards computer science, as they cover properties of combinatorial structures, their relationships to fundamental algorithms, and analytic results.

Though the book is intended to be self-contained, differences in emphasis are appropriate in teaching the material, depending on the background and experience of students and instructor. One approach, more mathematically oriented, would be to emphasize the theorems and proofs in the first part of the book, with applications drawn from Chapters 5-8. Another approach, more oriented towards computer science, would be to briefly cover the major mathematical tools in Chapters 2-4 and emphasize the algorithmic material in the second half of the book. But our primary intention is that most students should be able to learn new material from both mathematics and computer science in an interesting context by working carefully all the way through the book.

Students with a strong computer science background are likely to have seen many of the algorithms and data structures from the second half of the book but not much of the mathematical material at the beginning; students with a strong background in mathematics are likely to

From the Back Cover

"People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant mathematical patterns that surround elegant computational procedures. Then they receive a practical payoff when their theories make it possible to get other jobs done more quickly and more economically.... The appearance of this long-awaited book is therefore most welcome. Its authors are not only worldwide leaders of the field, they also are masters of exposition." --D. E. Knuth

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


020140009XB04062001


More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

4.7 out of 5 stars
5 star
4
4 star
2
3 star
0
2 star
0
1 star
0
See all 6 customer reviews
Share your thoughts with other customers

Most Helpful Customer Reviews

55 of 55 people found the following review helpful By Amazon Customer on January 16, 2001
Format: Paperback
This is an excellent book on the analysis of algorithms. More specifically, it is a book on the mathematics needed for the analysis of algorithms. Quite a few algorithms are presented and analyzed in great detail, but the emphasis is on the analysis techniques rather than on the algorithms.
This is in contrast with Cormen,Leiserson and Rivest, or Sedgewick's own "Algorithms" series which emphasize the algorithms rather than the analysis.
If you're looking for a catalog of algorithms along with explanations, you want a different book, but if you want to know how to analyze that bizarre code (which Fred in the next cubicle wrote) and prove that it works well (or doesn't) then this is an excellent choice.
The book is aimed at advanced undergrads/graduate students and assumes a certain amount of mathematical sophistication - i.e. calculus, discrete math, probability, etc.
On the spectrum from "Mathematical Techniques" through "Analysis of Algorithms" and ending up with "Catalog of Algorithms", I would start with Graham, Knuth and Patashnik "Concrete Mathematics", travel through this book, on to Knuth "The Art of Computer Programming", then to Cormen, Leiserson and Rivest, and finally end up with either Sedgewick's "Algorithms" or Skeina's "Algorithm Design Manual".
1 Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
21 of 21 people found the following review helpful By Sen Peng Eu on April 1, 2000
Format: Paperback Verified Purchase
For a long time analytic combinatorics lacks a good and comprehensive textbook. Almost every learner in this field learns this subject via scattered papers and chapters in different books or journels. The apprearence of this book is so welcome by learners and researchers that it offers a excellent introduction of this powerful and relatively new field. Flajolet and Sedgewick are the famous masters of this field, and this book proves that again. The writing style is succinct, with instant exercise(s) after every important concept and result. The pace of this book is very natural and self-contained. The first half of this book deals with the basic tools used for analysis of algorithm, from the recurrence, generating function, to asymptotic approx. Then it discusses 2 most crucial subjects: trees and permutations. The last 2 chapter turns to strings and words. I found it very readble that there is a typical and core example in every chapter. BTW, since I still haven't finished studying this book, but I must say that Chapter 5 (Asymptotic) is among many textbooks the best introduction to this hard topic so far.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
5 of 5 people found the following review helpful By cj2005 on February 4, 1999
Format: Paperback
I don't know whether the style of this book is good or not but for me the chapter on generating functions was very readable. At the time of reading I already have read several books for the understanding of generating functions; including Graham, Knuth, and Patashnik's "Concrete Mathematics," which is definitely great but difficult to me. I've got a solid understanding of the subject through two books: Polya et al's "Notes on Introductory Combinatorics" and Sedgewick and Flajolet's.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

What Other Items Do Customers Buy After Viewing This Item?