22 of 22 people found the following review helpful:
5.0 out of 5 stars
A real gem..., March 17, 2006
This review is from: Algorithms + Data Structures = Programs (Prentice-Hall Series in Automatic Computation) (Hardcover)
It might seem completely dated with all its examples written in the now outmoded Pascal programming language (well, unless you are one of those Delphi zealot trying to resist to the Java/.NET dominance), but it is still highly recommended.
It is the single book I learnt most from when I was a freshman studying Computer Science at my local University (when Pascal was already declining, I'm not so old ;-). I wish more recent books were as good as this one, but I have not found a single book so focused and, at the same time, so broad in scope as this one.
Wirth covers programming fundamentals (including recursion), many sorting algorithms, data structures (from simple data collections to B-trees and hashing), and basic compiler technology. That is, four books into one (and, surprisingly, this is not a hefty tome.)
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No
19 of 19 people found the following review helpful:
5.0 out of 5 stars
This is the book every programmer must read, July 22, 1999
By A Customer
This review is from: Algorithms + Data Structures = Programs (Prentice-Hall Series in Automatic Computation) (Hardcover)
This is the book every beginning programmer must read. Modern programmers know a lot about specific technical details, but they know nothing about effective algorithms. We're hiring new programmers now. We've tested a lot of folks with 5-8 years experience in Java. The result is nobody can implement basic operations with B-tree or combinatory algorithm. It's terrible. So read Niklaus Wirth if you want to be a serious programmer.
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No
15 of 15 people found the following review helpful:
5.0 out of 5 stars
A Necessary Block of a Programmer's Foundation, August 18, 2000
This review is from: Algorithms + Data Structures = Programs (Prentice-Hall Series in Automatic Computation) (Hardcover)
With only five chapters and 365 pp, this text presents fundamental data structures, sorting, the best treatise I've found on recursion, dynamic information structures, and language structures & compilers. The date of the text precludes object-oriented programming, yet the tools presented here are welcome adjuncts for Delphi developers.
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No
