Introduction to the Analysis of Algorithms, An
Product ID: 8167998
Buy anything from 5,000+ international stores. One checkout price. No surprise fees. Join 2M+ shoppers on Desertcart.
Desertcart purchases this item on your behalf and handles shipping, customs, and support to Greece.
Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field. Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematics and computer science, integrating discrete mathematics, elementary real analysis, combinatorics, algorithms, and data structures. They emphasize the mathematics needed to support scientific studies that can serve as the basis for predicting algorithm performance and for comparing different algorithms on the basis of performance. Techniques covered in the first half of the book include recurrences, generating functions, asymptotics, and analytic combinatorics. Structures studied in the second half of the book include permutations, trees, strings, tries, and mappings. Numerous examples are included throughout to illustrate applications to the analysis of algorithms that are playing a critical role in the evolution of our modern computational infrastructure. Improvements and additions in this new edition include Upgraded figures and code An all-new chapter introducing analytic combinatorics Simplified derivations via analytic combinatorics throughout The book’s thorough, self-contained coverage will help readers appreciate the field’s challenges, prepare them for advanced results―covered in their monograph Analytic Combinatorics and in Donald Knuth’s The Art of Computer Programming books―and provide the background they need to keep abreast of new research. "[Sedgewick and Flajolet] are not only worldwide leaders of the field, they also are masters of exposition. I am sure that every serious computer scientist will find this book rewarding in many ways." ―From the Foreword by Donald E. Knuth Review: satisfied - bought for a software engineer, thank you Review: Sobre el envío - Llegó en tiempo y forma, agradecido estoy.
| Best Sellers Rank | #1,037,900 in Books ( See Top 100 in Books ) #66 in Computer Programming Structured Design #291 in Programming Algorithms #323 in Computer Systems Analysis & Design (Books) |
| Customer Reviews | 4.5 out of 5 stars 31 Reviews |
A**R
satisfied
bought for a software engineer, thank you
M**G
Sobre el envío
Llegó en tiempo y forma, agradecido estoy.
C**R
Uncommonly good
I am a first year graduate student in mathematics, so keep that in mind if you're trying to generalize my review. I use nearly all the math discussed in the text for analytic number theory (I rarely program), but this book gives an especially nice treatment of the combinatorial mathematics. I really get excited every time I have to open this book. I typically learn best from books, so I have a good sense for what a book should feature for me to learn the material as quickly and effectively as possible. It's really a drag when something as superfluous as style or a purist aesthetic makes reading sluggish or just impossible to learn from. I want a book to have many problems (ranging between medium to very hard/open problems), solutions in the back, examples to make the more difficult concepts clear, both historical and modern motivations for the material, and clean, linear descriptions. This book hits all of these except the "solutions in the back" part. Despite this one "flaw", however, this book has other great features that compensate. For example, the typesetting is fresh and makes the text more engaging. Also, there are very beautiful graphs and great reference tables. It is really a wonderful book -- the authors clearly were purposeful in the design of this text.
H**T
Excellent book
If you are someone who want to learn how you can analyze algorithms deeply, you should read this fascinating book.
J**R
One of the best
If you would like to learn the foundation of computer science, this book is for you!
A**R
Amazing book.
Written in the spirit of Knuth.
G**I
Five Stars
Very good and complete for developers and Algorithm learners
A**Z
Review for Kindle Edition ONLY
The Kindle edition (at least judging by the free sample) has some formatting issues that render it not so usable. Of all things, in monospaced code samples the plus sign and minus signs ("+", "++", "-", "--") are not rendered on Kindle for PC (1.10.6). Other than that, the formatting appears to be better than in many Kindle math/CS textbooks, but mis-rendered code samples make this a non-purchase for me.
H**T
Not as expected and book returned
First at all, the one star is due to my personal expectations and not for the product in general! This book is basically a pure math book with theorems and profs page after page. I had expected a more practical computer science related approach for the algorithm analysis. Pretty useless for an software engineer IMHO but maybe useful for a hardcore math researcher. I returned the book.
E**A
Excelente
Excelente
A**R
Very Important Book
Very Nice Book and seller is also prompt
M**O
Indispensable para el estudiante y el profesional
Esta obra completa el vacío existente entre la enseñanza formal de un lenguaje de programación y el conocimiento de los algoritmos sobre qué se debe programar. Hoy en día cometemos el error docente de enseñar a decir, sin enseñar antes qué decir.
R**R
It is a fntastic book for calculating numeric recursive formulas
It needs a good background of math. Althought I haven't finished the book yet, but I found it unique in teaching solving recursive numeric functions. I constantly learn something new from it.
Trustpilot
3 days ago
3 weeks ago