Introduction to algorithms in PASCAL

Presents a large body of standard techniques and solutions to frequently occurring problems which the student should master before addressing more advanced aspects of program design. Contains chapters on searching, sorting, the growth and maintenance of binary trees, tree algorithms and elementary graph algorithms. Also includes external searching and sorting, dynamic programming, pattern matching in strings, text compression, random numbers and random sampling. This easy-to-read introduction makes algorithms clear and comprehensible to anyone with a basic computer science background and some discrete math. Presenting a complete introduction to algorithms written in PASCAL, it includes data structure topics and analysis to make the text and algorithms remarkably clear and comprehensible. Covering algorithms and data structure analysis using the PASCAL language, this text may be used to follow up an introductory course on PASCAL programming. Chapters on pattern matching, text compression and random numbers serve as case studies in which algorithms find application.