Data Structures: From Arrays to Priority Queues

This easy-to-read introductory text uses a step-by-step analysis of algorithm development as a springboard for the application of data structures. All algorithms are first presented in a simple form of pseudocode - thus the associated data structures may be implemented in a variety of high level languages including Pascal, ADA, Modula-2 and Algol. The variety of solutions to problems is deliberately emphasized, promoting a higher level of abstraction in a relatively gentle way. General data structures are presented early in the text and applied more specifically and thoroughly in the book's "Enhancements" section, designed to give students practical, complete applications of data structures in a real world context. Other features a separate chapter on hashing techniques; sorting techniques are integrated at appropriate points throughout; and fully annotated programs which illustrate theoretical concepts described in the text. This book should be of interest to degree and diploma students on introductory courses in data structures.