Algorithms and data structures. (New ed., revised). (English) Zbl 0634.68002

London etc.: Prentice-Hall International. 288 p. (1986).
[For a review of the German original (Teubner, Stuttgart, 1975) see Zbl 0353.68002, for a review of the first edition of the English translation (1976) see Zbl 0375.68005.]
The 1986 edition of this book consists of five chapters titled: Fundamental data strutures; Sorting; Recursive algorithms; Dynamic information structures; Key transformations (hashing). The fourth chapter makes up about one third of the book; the last chapter is short. Exercise sets appear at the end of each chapter.
The general approach to algorithm construction given in the book is to define an algorithm in terms of control and/or action statements which are then successively refined until a Modula-2 implementation is in place. Many of the algorithms are extensive, requiring several pages of text. Algorithms should be checked before using them directly. For example, in the “Knight’s tour” module presented on pages 150, 151, arrays dx, dy are declared but not used; arrays a, b are used but not declared; output presented on page 151 requires h[i,j] to be initialized rather than h[1,1] as given.
This text should be considered for an algorithms course, especially if Modula-2 is to be used as the implementation language.
Reviewer: D.D.Fisher


68-02 Research exposition (monographs, survey articles) pertaining to computer science
68P10 Searching and sorting
68P05 Data structures
68W99 Algorithms in computer science