Vous voulez voir cette page en français ? Cliquez ici.

Sign in to turn on 1-Click ordering.
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Foundations Of Algorithms [Hardcover]

Richard Neapolitan , Kumarss Naimipour

List Price: CDN$ 201.95
Price: CDN$ 186.94 & FREE Shipping. Details
You Save: CDN$ 15.01 (7%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Only 1 left in stock (more on the way).
Ships from and sold by Amazon.ca. Gift-wrap available.
Want it delivered Thursday, September 18? Choose One-Day Shipping at checkout.
Save Up to 90% on Textbooks
Hit the books in Amazon.ca's Textbook Store and save up to 90% on used textbooks and 35% on new textbooks. Learn more.
There is a newer edition of this item:
Foundations of Algorithms Foundations of Algorithms
CDN$ 149.51
In Stock.
Join Amazon Student in Canada

Book Description

Dec 28 2009 0763782505 978-0763782504 4
Foundations of Algorithms, Fourth Edition offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity. The volume is accessible to mainstream computer science students who have a background in college algebra and discrete structures. To support their approach, the authors present mathematical concepts using standard English and a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. The authors also reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts.

Special Offers and Product Promotions

  • Join Amazon Student in Canada

Customers Who Bought This Item Also Bought

Product Details

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Reviews

There are no customer reviews yet on Amazon.ca
5 star
4 star
3 star
2 star
1 star
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com: 4.2 out of 5 stars  9 reviews
4 of 4 people found the following review helpful
5.0 out of 5 stars Amazing Feb. 7 2012
By Oliver - Published on Amazon.com
This book is truly something. Everything is explained in great amount of detail and several examples of the different techniques used for algorithms are really well explained, and the best part is that you can actually understand it. While everything they say is demonstrated, they dont use as much mathematical notation as other books, instead, they take their time to explain it with words and examples (yet they do use just the right amount of math notation to prove everything they say).

The pseudocode is c++like and that helped me understand everything so much better. They explain complexity, divide and conquer, dynamic programming, greedy algotirithms, and so much more in a way thats easy to understand and well documented. They also include several books after every chapter where you can expand what you have learned. They also include a good amount of pictures.

All in all this is the only book which actually helped me understand prim, kruskal, and dijkstra in a way I could actually code it myself. So I am extremely thankful for that. Also, beware that I found one typo in prim which changed everything. :)
2 of 2 people found the following review helpful
5.0 out of 5 stars Great Book to Own July 3 2012
By coco - Published on Amazon.com
This book is to anyone from beginner to advanced CS students because the book is delivered in a sequential order from basics to advanced concepts, ease of comprehension, and very well illustrated examples. A Must have book.
1 of 1 people found the following review helpful
3.0 out of 5 stars Ok book but not complete Oct. 14 2013
By Mal - Published on Amazon.com
Format:Kindle Edition|Verified Purchase
Using this book for my algorithms analysis class and while the algorithms in the book are efficient the text itself is lacking without a supplemental book. Even my instructor says that without the supplemental book some of the problems in the book are not really doable.
5.0 out of 5 stars Nice book April 15 2014
By DT Pham - Published on Amazon.com
Format:Hardcover|Verified Purchase
This is my required textbook. I think it's nice with the examples and explanation. I bought the used book (like new), and it's really new.
5.0 out of 5 stars early arrival Aug. 15 2013
By doingthemost2 - Published on Amazon.com
Format:Hardcover|Verified Purchase
came extra early just before school started so i could at least read ahead to stay ahead of the class. cheaper than my stupid school!

Look for similar items by category