Practical algorithms for programmers
Our rough guess is there are 144,250 words in this book.
At a pace averaging 250 words per minute, this book will take 9 hours and 37 minutes to read. With a half hour per day, this will take 19 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Rex, John. - Contributor
- John H Rex - Author
Publication
1995 - Addison-Wesley, Reading, Mass, Massachusetts
Language
English
Word Count
144,250 words, Guess
Page Count
577 pages
Physical Format
Paperback
Identifiers
- Internet Archivepracticalalgorit00bins
- Internet Archivepracticalalgorit00bins_459
- Internet Archivepracticalalgorit00bins_671
- Internet Archivepracticalalgorit0000bins
- ISBN-139780201632088
and 6 more
- ISBN-10020163208X
- LibraryThing294294
- Library of Congress Control Number95006582
- OCLC Control Number32133263
- Better World Books9780201632088
- Open LibraryOL1275023M
Classifications
- DDC005.13/3
- LCCQA76.73.C15 B5 1995
- LCCQA76.73.C15B5 1995
Description
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.
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!