Fundamentals of Algorithmics 1st Edition

16 customer reviews
ISBN-13: 978-0133350685
ISBN-10: 0133350681
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Have one to sell? Sell on Amazon
Buy used
$7.49
Buy new
$178.69
Amazon Price New from Used from
Paperback, August 20, 1995
"Please retry"
$178.69
$38.87 $0.41
More Buying Choices
14 New from $38.87 45 Used from $0.41
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


InterDesign Brand Store Awareness Rent Textbooks
$178.69 FREE Shipping. Only 1 left in stock (more on the way). Ships from and sold by Amazon.com. Gift-wrap available.

Frequently Bought Together

Fundamentals of Algorithmics + PSP(sm): A Self-Improvement Process for Software Engineers + UML Distilled: A Brief Guide to the Standard Object Modeling Language (3rd Edition)
Price for all three: $259.61

Buy the selected items together

Editorial Reviews

From the Publisher

This is an introductory-level algorithm text. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application.

From the Back Cover

This is an introductory-level algorithm book. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application. Includes structured material by techniques employed, not by the application area, so readers can progress from the underlying abstract concepts to the concrete application essentials. It begins with a compact, but complete introduction to some necessary math. And it approaches the analysis and design of algorithms by type rather than by application.
NO_CONTENT_IN_FEATURE


Shop the New Digital Design Bookstore
Check out the Digital Design Bookstore, a new hub for photographers, art directors, illustrators, web developers, and other creative individuals to find highly rated and highly relevant career resources. Shop books on web development and graphic design, or check out blog posts by authors and thought-leaders in the design industry. Shop now

Product Details

  • Paperback: 524 pages
  • Publisher: Pearson; 1 edition (August 20, 1995)
  • Language: English
  • ISBN-10: 0133350681
  • ISBN-13: 978-0133350685
  • Product Dimensions: 7 x 1.3 x 9 inches
  • Shipping Weight: 2 pounds (View shipping rates and policies)
  • Average Customer Review: 2.9 out of 5 stars  See all reviews (16 customer reviews)
  • Amazon Best Sellers Rank: #1,130,332 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

21 of 24 people found the following review helpful By "headgasket" on November 10, 2000
Format: Paperback
This book is written in a simple style: algoritm class description, related proofs, examples, variations and exemples. Because of this clean approach, you can basically read it in a couple days if you have the necessary background knowledge, and in a couple weeks if not. I strongly recommend this book to everyone who are calling themselves "programers", either graduated or not, it will teach/remind them what are the elegant fundamental algorithmic approches to common problems; it's seems that today's software could use a bit of this elegance. As for all the negative reviews, I'm astonished. I own several books on the subject, and I find this one the easiest to read, no question. It must be some sort of personal vendetta against the author, a failed undegraduate course with this book as teaching material, or some other personal reason; that's probably why this/these person(s) whish(es) to remain anonymous.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
11 of 12 people found the following review helpful By Francisco Palomo on April 12, 2000
Format: Paperback
One of the few books organising algorithms around design techniques instead of application areas (see "Algorithms" from Sedgevick). Though both approachs have pros and cons, I've found the former most convenient for people learning to design algorithms. Many problems admit several solutions depending on the design tecnique involved. This fact is emphasized by the authors.
The book is self-contained, plainly written, so that an undergraduate can read it after taking a prerequisite course on programming.
It's also mathematically rigorous, while mantaining simplicity. This allows analysis of algorithms to be really "analytic" (no more guessing the solution to a recurrence relation).
One main drawback (certainly usual) is the lack of excercise solutions.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
8 of 9 people found the following review helpful By Oscar Meza on January 27, 2000
Format: Paperback
I don't agree with the other reviews. This book is a serious one and it is a "smooth" version of "Algorithms: Theory and Practice" from the same authors, which has a 5 stars rate. The book don't teach how to program, but the main kind of techniques in algorithm design (Greedy, Divide and Conquer and Dynamic Programing techniques, and others like Backtracking, Probabilistic Algorithms, etc.). I teach a course of Algorithm Design with this book (having the Sedgewick and Cormen books like additional very good references) and I think that it is a very instructive course on algorithmics (but NOT in programming, of course).
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
7 of 9 people found the following review helpful By Optimistix on June 3, 2002
Format: Paperback
This is a good book - far better than an average rating of 2 stars
would suggest. However, i think a big reason for such a rating is
that it's supposed to be an introductory textbook (as claimed by the
authors in the preface), and from that point of view, it leaves much
to be desired.
The presentation is such that it can be difficult for first-timers to
follow, and many topics are simply absent, e.g. network flows.
On the other hand, those already familiar with the material will find
it quite readable and handy as a reference or for brushing up.
The authors choose to present algorithms from a design point of view,
ie greedy approach, divide-and-conquer, bactracking, dynamic programming
etc instead of the traditional way of presenting algorithms for solving
a class of problems, e.g searching, sorting, graph algorithms and so on.
While this is good for those who're already familiar with the traditional
approach and also offers a unified view of problem-solving strategies in
Algorithmics, it is decidedly easier for the beginning student to have (e.g)
all sorting algorithms in one place than to discover that they're scattered
across different chapters.
All algorithms are presented in pseudocode, and are thus have no
programming language dependencies. A healthy number of solved examples
have been provided, and unsolved problems are numerous.
In summary, i think this is quite a good book for practitioners, researchers
and those doing an advanced course in Algorithms, whereas it may not be
suitable for an introductory course (except, perhaps, as a supplement).
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
2 of 2 people found the following review helpful A Kid's Review on January 4, 2006
Format: Paperback
I took the class IFT2121 given by Gilles Brassard, and thanks that we had book which is so well done and complete.

People misunderstand sometime the nature of this book. This book is not about providing algorithm recipe but to teach you the methods used to analyze the performance of algorithms.

Gilles Brassard is an outsanding teacher, he is very sharp, he knows his stuff inside out, and his book is a master piece!
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
6 of 8 people found the following review helpful By Abdul on July 11, 2001
Format: Paperback
I had the misfortune of enduring this book during a graduate level course in algorithm analysis. Bad writing and incomplete explanations make the book a bad choice to learn this complex topic. Most of the itricate and particularly tricky parts of various proofs are left as "exercise to the reader"! Why bother when there are so many better ones to choose from?
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
1 of 1 people found the following review helpful By David Bradshaw TOP 1000 REVIEWERVINE VOICE on December 3, 2011
Format: Paperback Verified Purchase
I got this book for an Algorithm class at my school, and found it to be a bit tough to read, it was very complex, and from the beginning started off with advance notation and highly mathematic language. The book does not provide nearly enough examples, to help with assignments (or problems from its review), and forced me to have to turn to the internet for easier to follow guidance. The book offers examples and plenty of proofs, which make this book nice for reference for proving a fact or referencing a paper, however, it is not very practical for use in the classroom, since it does not offer enough examples to follow to learn how to complete assignments.

In the end this book offers great proofs and highly involved algorithms in pseudocode and mathematical notation, which makes this book great for reference and writing papers, however, it lacks in helping in the classroom for assignments and other items where an easy to follow example would helpful. However, for any one interested in Computer Science, I would recommend this book, for reference for algorithms, and their worst/best case analysis.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Set up an Amazon Giveaway

Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more
Fundamentals of Algorithmics
This item: Fundamentals of Algorithmics
Price: $178.69
Ships from and sold by Amazon.com

What Other Items Do Customers Buy After Viewing This Item?

Want to discover more products? Check out this page to see more: algorithms