Introduction to Algorithms in Pascal

by Thomas W. Parsons

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.

444 pages, Paperback

First published October 1, 1994