Fundamentals of Algorithmics

By Michael Halvorson

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. This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 0133350681
• ISBN13: 9780133350685
• Release Date: August 1995
• Publisher: Pearson
• Length: 544 Pages
• Weight: 2.10 lbs.
• Dimensions: 1.0" x 7.2" x 9.6"

Customer Reviews

The most outstanding book in my entire collection

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!

Great as a supplement or reference, not as an introduction

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...

What's with all these negatived reviews?

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...

Fundamentals of Algorithmics

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...

It's a very good book for Algorithmic Techniques

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...