Mastering Algorithms with C (Paperback)

Kyle Loudon

  • 出版商: O'Reilly
  • 出版日期: 1999-09-14
  • 定價: $2,150
  • 售價: 9.0$1,935
  • 語言: 英文
  • 頁數: 562
  • 裝訂: Paperback
  • ISBN: 1565924533
  • ISBN-13: 9781565924536
  • 相關分類: C 程式語言Algorithms-data-structures
  • 立即出貨 (庫存 < 4)




There are many books on data structures and algorithms, and some books laying out useful libraries of C functions, but this book aims to give you a unique combination of theoretical background and working code. In offering robust solutions for everyday programming tasks,
Mastering Algorithms with C avoids the abstract style of most classic data structures and algorithms texts but still provides all 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 shown in the text. Full source code appears on the accompanying disk.

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 shows you how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. He also describes the relative efficiency of all implementations. The compression and encryption chapters not only give you working code for reasonably efficient solutions, they explain 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





Kyle Loudon以非常乾淨的編程風格和寫作風格,向您展示如何使用列表、堆疊、佇列、集合、樹、堆、優先佇列和圖等重要的資料結構。他還展示了如何使用排序、搜索、數值分析、數據壓縮、數據加密、常見圖問題和計算幾何的演算法。他還描述了所有實現的相對效率。壓縮和加密章節不僅提供了相對高效的解決方案的工作代碼,還以易於理解的方式解釋了概念,適合那些沒有時間或專業知識深入研究的人。



- 指針
- 遞歸
- 演算法分析
- 資料結構(列表、堆疊、佇列、集合、哈希表、樹、堆、優先佇列、圖)
- 排序和搜索
- 數值方法
- 數據壓縮
- 數據加密
- 圖演算法
- 幾何演算法