الگوریتم‌های عملی برای برنامه‌نویسان

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

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

The first book to provide a comprehensive, nonacademic treatment of the algorithms commonly used in advanced application development. The authors provide a wide selection of algorithms fully implemented in C with substantial practical discussion of their best use in a variety of applications.

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. A detailed book on algorithms and data structures fully implemented in C. It goes way beyond the usual coverage of these topics: rather than small snippets of code, each topic is covered in depth. For example, the B-tree includes the full code for a B-tree database. The algorithms cover the usual things: search, sort, hashing etc. But the book also covers algorithms rarely covered by other titles: the various data compression algorithms, complete date and time routines (with all the hinky calendar problems), Soundex (searching for names based on how they sound), arbitrary precision arithmetic, etc. The only downside is that the C code is from 1995, so the code feels a bit dated in parts. Providing a non-academic treatment of algorithms commonly used in advanced application development, this book features a selection of algorithms fully implemented in C with practical discussions of their use in various applications. Theoretical material is presented in an approachable manner. 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). Introduction Basic Data Structures Hashing Searching Sorting Trees Date and Time Arbitrary-precision Arithmetic Data Compression Data Integrity and Validation