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, immediate
Practical Algorithms for Programmers
โ Scribed by Andrew Binstock, John Rex
- Publisher
- Addison-Wesley Professional
- Year
- 1995
- Tongue
- English
- Leaves
- 596
- Edition
- Paperback
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
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 under UNIX and on compilers from Borland, Microsoft, and Watcom.
๐ SIMILAR VOLUMES
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, immediat
This book can be used as an experiment and reference book for algorithm design courses, as well as a training manual for programming contests. It contains 247 problems selected from ACM-ICPC programming contests and other programming contests. There's detailed analysis for each problem. All problems