- Series: Mastering
- Paperback: 562 pages
- Publisher: O'Reilly Media; 1 edition (August 15, 1999)
- Language: English
- ISBN-10: 1565924533
- ISBN-13: 978-1565924536
- Product Dimensions: 7 x 1.2 x 9.2 inches
- Shipping Weight: 2.4 pounds (View shipping rates and policies)
- Average Customer Review: 3.9 out of 5 stars See all reviews (26 customer reviews)
- Amazon Best Sellers Rank: #105,168 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Mastering Algorithms with C: Useful Techniques from Sorting to Encryption 1st Edition
Use the Amazon App to scan ISBNs and compare prices.
Frequently bought together
Customers who bought this item also bought
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.
Each section ends with questions and answers about how the algorithms work, along with references to other algorithms (both in the book and from other sources). The authors concentrate on the most useful algorithms available today and don't try to cover every available variation. Busy readers will appreciate the intelligent selection--and efficient presentation--used here.
There are a number of books on C algorithms, but Master Algorithms with C is one of the most concise and immediately useful. It's a perfect choice for the working C/C++ programmer who's in a hurry to find just the right algorithm for writing real-world code. --Richard Dragan
Topics covered: Algorithm efficiency, pointer basics, arrays, recursion, Big-O Notation, linked lists, stacks, queues, sets, hash tables, trees and B-trees, searching, heaps and priority queues, graphs, sorting and searching algorithms, numerical methods, data compression, Huffman coding, LZ77, data encryption, DES, RSA, graph algorithms, minimum spanning trees, geometric algorithms, and convex hulls.
From Library Journal
Although older than some of the current languages, C still is one of the best general purpose programming languages around. Loudon's book discusses C pointers, recursion, data structures from lists and stacks to trees and graphs, sorting and searching, and encryption. This is not a beginner's manual but will work well for programmers wanting to refresh their C techniques and for those moving from another language to C.
Copyright 1999 Reed Business Information, Inc.
If you are a seller for this product, would you like to suggest updates through seller support?
Top Customer Reviews
First, my five stars is kind of dependent upon the audience. You shouldn't buy this to teach yourself algorithms, it isn't a textbook. Instead it's quite good as a reference book for how algorithms you know pseudo for should be properly implemented in C. It's also enormously useful for data structure implementation, which can be tricky if you come from mainly using a language without pointers.
The only downside is its bigger than necessary due to comment size, but unlike others I don't think the book should really be judged on editor induced padding. It's a solid reference with excellent diagrams and clear explanations.
My criticism would be if you didn't know an algorithm at all, it can be a bit rough to get the exact details -- and given the large amount of code in the book, I suppose the author expects you to fill in the details by reading the code. This probably makes it inferior to other books for /learning/, but again, if you're just reviewing, this isn't really a problem.
Tech books and Kindle don’t usually get along, but there are some great exceptions to this, such as CLR via C# (Richter), but with this book many of the code samples look like an absolute mess because of all the asterisks spanning across the pages (since the Kindle is only so wide and I can only have the font so small).
Every single comment is formatted as follows. It doesn’t matter if you’re in the middle of an if-loop or other control structure, they all go like:
/************************** (except instead of 30 asterisks there’s always 80!)
Comment goes here
/************************** (another 80 stars here)
(another blank space)
That’s right , every comment takes up 9 lines if your screen is wide enough, even more if characters have to wrap around! It’s completely crazy that the author thinks this is an acceptable commenting style, it’s actually the worst I’ve seen in my entire 18 year career.
It would be one thing if these comments were only at the very top of the code snippet or above a method signature or something, but this is his standard commenting style throughout the code, and he writes a LOT of comments, it really beaks up the flow.
Most Recent Customer Reviews
prerequisite: should know about programming & C
An excellent C book is "Beginning C 5th ed" by Ivan...Read more