Mastering Algorithms with C

There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday programming tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of the information you need to understand the purpose and use of common programming techniques.

Implementations, as well as interesting, real-world examples of each data structure and algorithm, are included.

Using both a programming style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations. The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of concepts in an approachable manner for people who never have had the time or expertise to study them in depth.

Anyone with a basic understanding of the C language can use this book. In order to provide maintainable and extendible code, an extra level of abstraction (such as pointers to functions) is used in examples where appropriate. Understanding that these techniques may be unfamiliar to some programmers, Loudon explains them clearly in the introductory chapters.

Contents include:

  • Pointers
  • Recursion
  • Analysis of algorithms
  • Data structures (lists, stacks, queues, sets, hash tables, trees, heaps, priority queues, graphs)
  • Sorting and searching
  • Numerical methods
  • Data compression
  • Data encryption
  • Graph algorithms
  • Geometric algorithms

Table of Contents
Part I: Preliminaries
Chapter 1. Introduction
Chapter 2. Pointer Manipulation
Chapter 3. Recursion
Chapter 4. Analysis of Algorithms

Part II: Data Structures
Chapter 5. Linked Lists
Chapter 6. Stacks and Queues
Chapter 7. Sets
Chapter 8. Hash Tables
Chapter 9. Trees
Chapter 10. Heaps and Priority Queues
Chapter 11. Graphs

Part III: Algorithms
Chapter 12. Sorting and Searching
Chapter 13. Numerical Methods
Chapter 14. Data Compression
Chapter 15. Data Encryption
Chapter 16. Graph Algorithms
Chapter 17. Geometric Algorithms

Book Details

  • Paperback: 560 pages
  • Publisher: O’Reilly Media (August 1999)
  • Language: English
  • ISBN-10: 1565924533
  • ISBN-13: 978-1565924536
Download [6.3 MiB]

You may also like...

No Responses

  1. fan01 says:

    Please check the link. It always gets timed out!

    While Objective-C is getting popular, the C language is regaining its popularity. This is a good book about C. The earliest release was in chm format a few years ago. And some pdf format converted from chm emerged in the mean time, but they looked really argly.
    I believe this release in the link contains a real pdf version.

    thanks pal.

  2. fan01 says:

    Downloaded with FireFox like chime!
    Thanks again!

  3. Wow! says:

    Yes, this pdf version is like print version, also include epub.
    Download it now 😉

  4. z2g007 says:

    Nice book on Algorithms and Data structures.

Leave a Reply