Algorithmics: The Spirit of Computing

By David Harel and Yishai Feldman

Book Overview

Provides a study of the fundamental theoretical ideas of computing and examining how to design accurate and efficient algorithms.

• Format: Paperback
• Language: English
• ISBN: 0201192403
• ISBN13: 9780201192407
• Release Date: January 1987
• Publisher: Addison Wesley Publishing Company
• Length: 425 Pages
• Weight: 0.85 lbs.
• Dimensions: 0.8" x 6.1" x 9.1"

Customer Reviews

A great book!

This book is the most amazing book on algorithms I've read. The concepts are so well explained that moving to "An introduction to Algorithms by Cormen, Rivest" will be very easy. I come from a non-computer science background. When I started my coursework in Computer Science I was intimidated with Cormen - (although that IS THE MOST AUTHORITATIVE and a complete text!) until I found Harel. Harel covers ALL the key aspects of...

'The Essence of Theoretical Computer Science'

As the author says, the members of the research community of Computer Science have done their discipline a disservice by not making any special efforts to write accessible accounts of the field, as a result of which the 'layman' still has little idea of what goes on 'under the hood', so to say. He has therefore undertaken the challenging task of presenting the basic ideas underpinning Computer Science in a way that's easy...

'Theoretical Computer Science at 10,000 feet'

As the author says, the members of the research community of Computer Science have done their discipline a disservice by not making any special efforts to write accessible accounts of the field, as a result of which the 'layman' still has little idea of what goes on 'under the hood', so to say. He has therefore undertaken the challenging task of presenting the basic ideas underpinning Computer Science in a way that's...

An easy-to-read, for-all-readers algorithms book

This is a truly magnificent book. It comprehensively covers most of the topics in the analysis and design of alogorithms with no mathematical burden to hamper you from getting through this subjet. Later on, you will most probably need a more intensive and mathmetical-analysis oriented book but be sure this second book will be far more easy to go through after you have have finished the "Algorithmics" book. Enjoy it.

Just a great book !

This book is just fantastic. It gives a perfect introduction to the most important aspects of algorithm design, correctness, complexity, P vs NP, etc. It has solid foundations in the theory, and brings these difficult concepts within reach of the average programmer, in an easily readable style. Kudos to the author.