No specific area of application is emphasized as an end in itself; exercises and examples are selected according to their suitability to demonstrate more generally valid problems and methods of solution. In the same vein, fundamental algorithmic structures are emphasized rather than particulars of notation and if programming language.
This book is tailored to the needs of people who view a course on systematic construction of algorithms as part of their basic mathematical training, rather than to the immediate needs of those who wish to be able to occasionally encode a problem and hand it over to their computer for instant solution.
Contents include chapters devoted to fundamental data structures, internal and external sorting, recursive algorithms, dynamic data structures (recursive data types, pointers, list structures, tree structures, optimal search trees, multiway trees, and key transformations), and language structures and compiling (language definition and analysis, syntax graphs, parser and translator construction).
Among the Features
• Covers important basic techniques of program and data structuring
and demonstrates their suitability to a wide variety of practical applications.
• Develops programs in step-wise fashion, and expresses them in a well-structured, detailed, and unambiguous presentation.
• Stresses the importance of performance analysis and demonstrates how algorithm selection and refinement are used most effectively in program design.
• Presents illustrative programs that were run and thoroughly tested before their inclusion here.
• Practically oriented, employs the minimum required mathematical formalism.