Programming Classics: Implementing the World's Best Algorithms

Front Cover
Prentice Hall, 1993 - Computers - 386 pages
This volume provides a catalogue of the best algorithms ever devised for a wide range of practical problems facing those who write computer programs. Less mathematical and more practical in approach than other volumes, it helps programmers save research and programming time and enables them to quickly and easily generate efficient structured code in solving such problems. Complete algorithms are provided — along with discussions of their use and an in-depth analysis of each. Provides utility algorithms as well as those useful in numbering, permuting, data structuring, sorting, searching, randomizing, bookkeeping, financing, curve fitting, file updating, evaluating, and estimating. A tool kit of solutions for all levels of computer programmers in industry and business.

From inside the book


Permutations and Combinations

10 other sections not shown

Common terms and phrases

Bibliographic information