An Introduction to the Analysis of Algorithms (2nd Edition) and over 2 million other books are available for Amazon Kindle . Learn more
  • RRP: £49.99
  • You Save: £2.50 (5%)
FREE Delivery in the UK.
Only 3 left in stock (more on the way).
Dispatched from and sold by Amazon.
Gift-wrap available.
Quantity:1
An Introduction to the An... has been added to your Basket
+ £2.80 UK delivery
Used: Very Good | Details
Sold by UK Media Source
Condition: Used: Very Good
Comment: Ships SAME or NEXT business day. See our member profile for customer support contact info. We have an easy return policy.
Trade in your item
Get a £9.82
Gift Card.
Have one to sell?
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 Hardcover – 18 Jan 2013


See all 2 formats and editions Hide other formats and editions
Amazon Price New from Used from
Kindle Edition
"Please retry"
Hardcover
"Please retry"
£47.49
£43.33 £41.43

Frequently Bought Together

An Introduction to the Analysis of Algorithms + Algorithms
Price For Both: £100.48

Buy the selected items together


Trade In this Item for up to £9.82
Trade in An Introduction to the Analysis of Algorithms for an Amazon Gift Card of up to £9.82, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Learn more

Product details


More About the Author

Discover books, learn about writers, and more.

Product Description

About the Author

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University, where was founding chair of the computer science department and has been a member of the faculty since 1985. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He is the coauthor of the landmark introductory book, Algorithms, Fourth Edition. Professor Sedgewick earned his Ph.D from Stanford University under Donald E. Knuth.

 

The late Philippe Flajolet was a Senior Research Director at INRIA, Rocquencourt, where he created and led the ALGO research group. He is celebrated for having opened new lines of research in the analysis of algorithms; having systematized and developed powerful new methods in the field of analytic combinatorics; having solved numerous difficult, open problems; and having lectured on the analysis of algorithms all over the world. Dr. Flajolet was a member of the French Academy of Sciences.


Inside This Book (Learn More)
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index
Search inside this book:

What Other Items Do Customers Buy After Viewing This Item?

Customer Reviews

There are no customer reviews yet on Amazon.co.uk.
5 star
4 star
3 star
2 star
1 star

Most Helpful Customer Reviews on Amazon.com (beta)

Amazon.com: 4 reviews
26 of 27 people found the following review helpful
A valuable read 4 Mar. 2013
By Roc - Published on Amazon.com
Format: Hardcover
This is a highly digestible math book and the focus is on a formal approach of accurate analysis (not just worst case or average case) for most algorithms. It is not a substitute of the CLRS or other popular textbooks, it is a somewhat different approach. The text tells you what you need to worry about when analyzing algorithmic topics, and explains the "how"s very clearly and nicely paced. The effect is that while reading, I never have the dread that I am not able to finish a typical thousand-page theory book. It prepares you for the author's Analytic Combinatorics and Knuth's TAOCP, but I find it equally useful just to better understand algorithms overall.
7 of 7 people found the following review helpful
Uncommonly good 10 Jun. 2014
By Customer - Published on Amazon.com
Format: Hardcover Verified Purchase
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.
1 of 1 people found the following review helpful
Five Stars 17 Nov. 2014
By J. Lohse - Published on Amazon.com
Format: Kindle Edition Verified Purchase
You can't beat this book for studying algorithms.
13 of 20 people found the following review helpful
Review for Kindle Edition ONLY 13 Sept. 2013
By Amazon Customer - Published on Amazon.com
Format: Kindle Edition
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.
Were these reviews helpful? Let us know

Look for similar items by category


Feedback