Practical Algorithms for Programmers - Softcover

Binstock, Andrew; Rex, John

Softcover

ISBN 10: 020163208X ISBN 13: 9780201632088

Publisher: Addison-Wesley Professional, 1995

Synopsis

Provides a comprehensive, non-academic treatment of the algorithms commonly used in advanced application development, shows how professional programmers actually use algorithms in their daily work, and requires no previous familiarity with the theory of algorithms. Original. (Advanced).

About this title

From the Back Cover:

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.

020163208XB04062001

About the Author:

Andrew Binstock is editor-in-chief of UNIX Review and founding editor of the C Gazette. He was the lead author of HP LaserJet Programming (Addison-Wesley, 1991).

John Rex is a computer consultant specializing in C and C++. He is the former technical editor of the C Gazette and has written articles for numerous magazines.

020163208XAB04062001

About this edition

• Publisher: Addison-Wesley Professional
• Publication date: 1995
• ISBN 10: 020163208X
• ISBN 13: 9780201632088
• Binding: Paperback
• Edition number: 1
• Number of pages: 592