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.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your e-mail address or mobile phone number.

Kindle Price: £20.50

Save £9.49 (32%)

includes VAT*
* Unlike print books, digital books are subject to VAT.

These promotions will be applied to this item:

Some promotions may be combined; others are not eligible to be combined with other offers. For details, please see the Terms & Conditions associated with these promotions.

Deliver to your Kindle or other device

Deliver to your Kindle or other device

Flip to back Flip to front
Audible Narration Playing... Paused   You are listening to a sample of the Audible narration for this Kindle book.
Learn more

Mastering Algorithms with C Kindle Edition

3.9 out of 5 stars 7 customer reviews

See all formats and editions Hide other formats and editions
Amazon Price
New from Used from
Kindle Edition
"Please retry"

Length: 562 pages

Romance Sale: Kindle Books from 99p
Browse more than 150 titles in Romance and Literature & Fiction on sale until 21 February, 2016. Shop now
Get a £1 credit for movies or TV
Enjoy £1.00 credit to spend on movies or TV on Amazon Video when you purchase any Amazon Kindle ebook from the Kindle Store (excluding Kindle Unlimited, Periodicals and free Kindle ebooks) offered by Amazon.co.uk. A maximum of 1 credit per customer applies. UK customers only. Offer ends at on Friday, 26 February, 2016. Terms and conditions apply

Product Description

Amazon Review

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 such as 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 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, convex hulls.


'This is an O'Reilly book, surely one of the best publishers of technical books areound. I love 'em, from the animal cover to the Colophon, and it is rare indeed that I come across an O'Reilly book that I regret buying....So, all in all, an enjoyable book and one I will move onto my Important Algorithm Book shelf, rather than on the floor in a pile with the also-rans. Recommended.' - Julian M Bucknall Developers Review, August 2000

Product details

  • Format: Kindle Edition
  • File Size: 2301 KB
  • Print Length: 562 pages
  • Simultaneous Device Usage: Unlimited
  • Publisher: O'Reilly Media; 1 edition (5 Aug. 1999)
  • Sold by: Amazon Media EU S.à r.l.
  • Language: English
  • ASIN: B0043EWV5Q
  • Text-to-Speech: Enabled
  • X-Ray:
  • Word Wise: Not Enabled
  • Enhanced Typesetting: Not Enabled
  • Average Customer Review: 3.9 out of 5 stars 7 customer reviews
  • Amazon Bestsellers Rank: #595,751 Paid in Kindle Store (See Top 100 Paid in Kindle Store)
  •  Would you like to give feedback on images or tell us about a lower price?

More About the Author

Discover books, learn about writers, and more.

Customer Reviews

3.9 out of 5 stars
Share your thoughts with other customers

Top Customer Reviews

Format: Paperback
This book offers a solid introduction to algorithms in the C programming language. All the key topics are covered, and the example code is well written. My only criticism would be the block commenting style the author uses, but the proportional font used makes them less distracting than they might have been. If this book whets the appetite, then Sedgewicks "Algorithms in C" offers a more in depth follow up.
I must comment on one of the other reader reviews, which has been cribbed from a similar review on the website of O'Reilly, this books publishers. Anyone who doesn't know the fundamental problems with numeric accuracy on computers should not be at a stage where they need to know algorithms in C. Any good computing course should cover the fundamentals of how numbers are stored, stressing the lack of precision and the possibility of overflow, before any in depth programming is taught.
Comment 6 of 6 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Paperback Verified Purchase
"[O'Reilly] where the first publisher I contacted, and the one I most wanted to work with because of their tradition of books covering 'just the facts'" - from the Preface.

This book covers just the facts, in 500 pages it gives a grand tour of algorithms and data structures and that 500 pages includes extensive pieces of code, it manages this by sticking to short, pithy descriptions and being unafraid to stop the description when the algorithm is described. This seems almost a mania, for example, we are told that algorithms that divide the data in two again and again incur a cost of log n, but the three or four lines it would take to prove this are skipped, we are told a couple of times that a factor of n(n+1)/2 is the result of the "well known formula" for adding the numbers 1 to n, it would've seemed easy to give the formula. The result though is a very useful and precise book you could go to in a hurry and remind yourself how radix sort works, or formalize your hazy knowledge of data structures.

For very slow and careful study the code listing would be invaluable but it seems a waste not to have include more commentary on the code, commentary as opposed to comments, the code itself is commented like real code in a way that is wasteful of space without being pleasant to read. The author writes so well but the code is left most to stand for itself, to understand it you have to read it line by line and work it out. In this way, the book aims itself at a painstaking study or as a source of quick reference, but is unsuitable for a middle course of directed reading, where code commentary is essential.

A rose is a rose is rose: the author wanted to write an O'Reilly book, this is what it is and if that's what you want, this book is for you.
Comment 2 of 2 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Paperback Verified Purchase
Good source of algorithms in C, it helped me a lot, but...
Who came up with the idea of printing a source code (including comments, etc) in the book? It looks awful and is hard to read. That's one of the sins of programmers, to include the full source code in the report/publication. If author really wants to put the source code in the book, then at least please do it in the appendix, without ridiculous block comments, and disturbing the read with 3 pages of code between reading paragraphs...
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Paperback
This book is fantastic. It covers a wide range of topics including sorting, data compression, trees and encryption. It also covers complexity notation and the basic maths behind various aspects.
I would recommend it to anyone.
Comment 6 of 8 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
First post:
Prompts for sign-in

Search Customer Discussions
Search all Amazon discussions