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 all 2 images

Foundations Of Algorithms Hardcover – Dec 28 2009


See all formats and editions Hide other formats and editions
Amazon Price
New from Used from
Hardcover
"Please retry"
CDN$ 32.24 CDN$ 47.24

There is a newer edition of this item:

Foundations of Algorithms
CDN$ 159.19
In Stock.

Harry Potter and the Cursed Child
click to open popover

No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.
Getting the download link through email is temporarily not available. Please check back later.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.




Product Details

  • Hardcover: 627 pages
  • Publisher: Jones & Bartlett Learning; 4 edition (Dec 28 2009)
  • Language: English
  • ISBN-10: 0763782505
  • ISBN-13: 978-0763782504
  • Product Dimensions: 22.9 x 18.8 x 3.6 cm
  • Shipping Weight: 1.2 Kg
  • Average Customer Review: Be the first to review this item
  • Amazon Bestsellers Rank: #411,668 in Books (See Top 100 in Books)
  •  Would you like to update product info, give feedback on images, or tell us about a lower price?

  • See Complete Table of Contents

What Other Items Do Customers Buy After Viewing This Item?

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: HASH(0xa1ab100c) out of 5 stars 10 reviews
6 of 6 people found the following review helpful
By Oliver - Published on Amazon.com
Format: Hardcover
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
HASH(0xa1cc8f18) out of 5 stars Great Book to Own July 3 2012
By coco - Published on Amazon.com
Format: Hardcover
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
By OD - Published on Amazon.com
Format: Hardcover Verified Purchase
Very well written and explained throughout. This book is pretty math-heavy, but they go to great effort to keep it readable, and this is new to me.
By masato naka - Published on Amazon.com
Format: Hardcover Verified Purchase
In short, I like this book. The contents are well-organized. Graphs, tables and examples are effectively used as well. Each section has its specific example, which helps beginners easily grasp its concept.
HASH(0xa1a0afd8) 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.


Feedback