Publisher: O'Reilly Media, Inc.Language: English
ISBN: 1565924533
Paperback: 560 pages
Data: August 5, 1999
Format: CHM
Description: Written with the intermediate to advanced C programmer in mind, Mastering Algorithms with C delivers a no-nonsense guide to the most common algorithms needed by real-world developers.
The highlight of the book has to be its concise and readable C functions for all the algorithms presented here, including basics like linked lists, stacks to trees, graphs, and sorting/searching algorithms. The C functions that implement these algorithms are clearly printed and remarkably easy to read. You can use this sample code directly or adapt it into your C/C++ code.
Although mathematical concepts like Big-O notation are discussed, the authors don't get bogged down in the computer science theory surrounding algorithms. Instead, they present the most tried-and-true algorithms available today in an efficient format. Besides introducing each algorithm, they describe how each is used in computing today, along with a short demo application. Some of these samples are quite low-level, such as a virtual memory manager implemented with linked lists. Most examples are more of general interest, such as a graphing example that counts network hops.