Practical Algorithms for Programmers
Practical Algorithms for Programmers By Andrew Binstock, John Rex
Publisher: Ad[dis]on-W[esl]ey Profe[ss..ion]al 1995 | 585 Pages | ISBN: 020163208X | DJVU | 6 MB
Publisher: Ad[dis]on-W[esl]ey Profe[ss..ion]al 1995 | 585 Pages | ISBN: 020163208X | DJVU | 6 MB
Most algorithm books today are either academic textbooks or rehashes of the same tired set of algorithms. Practical Algorithms for Programmers is the first book to give complete code implementations of all algorithms useful to developers in their daily work. This book focuses on practical, immediately usable code with extensive discussion of portability and implementation-specific details. The authors present the useful but rarely discussed algorithms for phonetic searches, date and time routines (to the year AD 1), B-trees and indexed files, data compression, arbitrary precision arithmetic, checksums and data validation, as well as the most comprehensive coverage available of search routines, sort algorithms, and data structures. Practical Algorithms for Programmers requires only a working knowledge of C and no math beyond basic algebra. The source code is ANSI-compliant and has been tested and run on compilers from Borland, Microsoft, Watcom, and UNIX.