Practical Algorithms for Programmers / Edition 1

Practical Algorithms for Programmers / Edition 1

by Andrew Binstock, John Rex
     
 

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

See more details below

Overview

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

Read More

Product Details

ISBN-13:
9780201632088
Publisher:
Addison-Wesley
Publication date:
06/09/1995
Pages:
592
Product dimensions:
7.20(w) x 9.10(h) x 1.30(d)

Meet 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

Table of Contents

Preface
Ch. 1Introduction1
Ch. 2Basic Data Structures13
Ch. 3Hashing63
Ch. 4Searching95
Ch. 5Sorting173
Ch. 6Trees245
Ch. 7Date and Time363
Ch. 8Arbitrary-Precision Arithmetic393
Ch. 9Data Compression467
Ch. 10Data Integrity and Validation535
Index571

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >