This advanced programming book integrates both problem solving and programming

skills in a clearly understandable way. It includes the most understandable presentation

of recursion and recursive problem solving available; it is the only book that uses and

implements data abstraction throughout to take advantage of one of the most innovative

features of Modula-2.

It discusses all important topics and more--

Data Abstraction is used as a problem-solving tool for increasing the modularity of

a program--for building "walls" between a program and its data structures.

The discussion of recursion, "mirrors," includes examples from simple recursive

definitions to recursive algorithms for searching and sorting. Reviewers comment

that it is the most understandable presentation of recursion available.

Classic computer science topics are thoroughly discussed: algorithm efficiency, stacks

and queues, sorting and searching, hashing, loop invariants, and binary search trees.

The review of structured programming with Modula-2 includes pointer variables and

linked lists.