- Prime Student members get £10 off with a spend of £40 or more on Books. Enter code SAVE10 at checkout. Enter code SAVE10 at checkout. Here's how (terms and conditions apply)
Algorithms Paperback – 16 Oct 2006
|New from||Used from|
- Choose from over 13,000 locations across the UK
- Prime members get unlimited deliveries at no additional cost
- Find your preferred location and add it to your address book
- Dispatch to this address when you check out
Special offers and product promotions
Frequently bought together
Customers who bought this item also bought
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Would you like to tell us about a lower price?
If you are a seller for this product, would you like to suggest updates through seller support?
What other items do customers buy after viewing this item?
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
It covers a big range of subjects(which i list since I see no preview possibility provided):
- algorithms for numbers
- divide & conquer
- algorithms for graphs
- greedy algorithms
- dynamic programming
- linear programming
- NP completeness
- quantum algorithms
A big plus: the writers really try to give the intuition behind the proofs
I definetely recommend it!
Very concise and rich content.
If you have been studied for like half year or one year, this book will instantly summarise what you've learnt in a simple but expressive way.
Highly recommend. Even if you are a beginner, don't forget it and you will need it one day.
Most helpful customer reviews on Amazon.com
Regardless, it's a good book to pick up, and not a very dense read through. At least, this is speaking from the perspective of someone who actually is interested in algorithms and has some discrete mathematics knowledge. If you are looking for something with more general knowledge (though I'm not really sure what I mean by that), this might be a tad bit hard to read, but I feel it's still worth the challenge.