文件名称:
Mastering Algorithms with C.chm
开发工具:
文件大小: 1mb
下载次数: 0
上传时间: 2010-05-26
详细说明： Part I: Preliminaries Chapter 1. Introduction Section 1.1. An Introduction to Data Structures Section 1.2. An Introduction to Algorithms Section 1.3. A Bit About Software Engineering Section 1.4. How to Use This Book Chapter 2. Pointer Manipulation Section 2.1. Pointer Fundamentals Section 2.2. Storage Allocation Section 2.3. Aggregates and Pointer Arithmetic Section 2.4. Pointers as Parameters to Functions Section 2.5. Gener ic Pointers and Casts Section 2.6. Function Pointers Section 2.7. Questions and Answers Section 2.8. Related Topics Chapter 3. Recursion Section 3.1. Basic Recursion Section 3.2. Tail Recursion Section 3.3. Questions and Answers Section 3.4. Related Topics Chapter 4. Analysis of Algorithms Section 4.1. Worst-Case Analysis Section 4.2. O-Notation Section 4.3. Computational Complexity Section 4.4. Analysis Example: Insertion Sort Section 4.5. Questions and Answers Section 4.6. Related Topics Part II: Data Structures Chapter 5. Linked Lists Section 5.1. Description of Linked Lists Section 5.2. Interface for Linked Lists Section 5.3. Implementation and Analysis of Linked Lists Section 5.4. Linked List Example: Frame Management Section 5.5. Description of Doubly-Linked Lists Section 5.6. Interface for Doubly-Linked Lists Section 5.7. Implementation and Analysis of Doubly Linked Lists Section 5.8. Description of Circular Lists Section 5.9. Interface for Circular Lists Section 5.10. Implementation and Analysis of Circular Lists Section 5.11. Circular List Example: Second-Chance Page Replacement Section 5.12. Questions and Answers Section 5.13. Related Topics Chapter 6. Stacks and Queues Section 6.1. Description of Stacks Section 6.2. Interface for Stacks Section 6.3. Implementation and Analysis of Stacks Section 6.4. Description of Queues Section 6.5. Interface for Queues Section 6.6. Implementation and Analysis of Queues Section 6.7. Queue Example: Event Handling Section 6.8. Questions and Answers Section 6.9. Related Topics Chapter 7. Sets Section 7.1. Description of Sets Section 7.2. Interface for Sets Section 7.3. Implementation and Analysis of Sets Section 7.4. Set Example: Set Covering Section 7.5. Questions and Answers Section 7.6. Related Topics Chapter 8. Hash Tables Section 8.1. Description of Chained Hash Tables Section 8.2. Interface for Chained Hash Tables Section 8.3. Implementation and Analysis of Chained Hash Tables Section 8.4. Chained Hash Table Example: Symbol Tables Section 8.5. Description of Open-Addressed Hash Tables Section 8.6. Interface for Open-Addressed Hash Tables Section 8.7. Implementation and Analysisof Open Addressed Hash Tables Section 8.8. Questions and Answers Section 8.9. Related Topics Chapter 9. Trees Section 9.1. Description of Binary Trees Section 9.2. Interface for Binary Trees Section 9.3. Implementation and Analysis of Binary Trees Section 9.4. Binary Tree Example: Expression Processing Section 9.5. Description of Binary Search Trees Section 9.6. Interface for Binary Search Trees Section 9.7. Implementation and Analysis of Binary Search Trees Section 9.8. Questions and Answers Section 9.9. Related Topics Chapter 10. Heaps and Priority Queues Section 10.1. Description of Heaps Section 10.2. Interface for Heaps Section 10.3. Implementation and Analysis of Heaps Section 10.4. Description of Priority Queues Section 10.5. Interface for Priority Queues Section 10.6. Implementation and Analysis of Priority Queues Section 10.7. Priority Queue Example: Parcel Sorting Section 10.8. Questions and Answers Section 10.9. Related Topics Chapter 11. Graphs Section 11.1. Description of Graphs Section 11.2. Interface for Graphs Section 11.3. Implementation and Analysis of Graphs Section 11.4. Graph Example: Counting Network Hops Section 11.5. Graph Example: Topological Sorting Section 11.6. Questions and Answers Section 11.7. Related Topics Part III: Algorithms Chapter 12. Sorting and Searching Section 12.1. Description of Insertion Sort Section 12.2. Interface for Insertion Sort Section 12.3. Implementation and Analysis of Insertion Sort Section 12.4. Description of Quicksort Section 12.5. Interface for Quicksort Section 12.6. Implementation and Analysis of Quicksort Section 12.7. Quicksort Example: Directory Listings Section 12.8. Description of Merge Sort Section 12.9. Interface for Merge Sort Section 12.10. Implementation and Analysis of Merge Sort Section 12.11. Description of Counting Sort Section 12.12. Interface for Counting Sort Section 12.13. Implementation and Analysis of Counting Sort Section 12.14. Description of Radix Sort Section 12.15. Interface for Radix Sort Section 12.16. Implementation and Analysis of Radix Sort Section 12.17. Description of Binary Search Section 12.18. Interface for Binary Search Section 12.19. Implementation and Analysis of Binary Search Section 12.20. Binary Search Example: Spell Checking Section 12.21. Questions and Answers Section 12.22. Related Topics Chapter 13. Numerical Methods Section 13.1. Description of Polynomial Interpolation Section 13.2. Interface for Polynomial Interpolation Section 13.3. Implementation and Analysis of Polynomial Interpolation Section 13.4. Description of Least-Squares Estimation Section 13.5. Interface for Least-Squares Estimation Section 13.6. Implementation and Analysis of Least-Squares Estimation Section 13.7. Description of the Solution of Equations Section 13.8. Interface for the Solution of Equations Section 13.9. Implementation and Analysis of the Solution of Equations Section 13.10. Questions and Answers Section 13.11. Related Topics Chapter 14. Data Compression Section 14.1. Description of Bit Operations Section 14.2. Interface for Bit Operations Section 14.3. Implementation and Analysis of Bit Operations Section 14.4. Description of Huffman Coding Section 14.5. Interface for Huffman Coding Section 14.6. Implementation and Analysis of Huffman Coding Section 14.7. Huffman Coding Example: Optimized Networking Section 14.8. Description of LZ77 Section 14.9. Interface for LZ77 Section 14.10. Implementation and Analysis of LZ77 Section 14.11. Questions and Answers Section 14.12. Related Topics Chapter 15. Data Encryption Section 15.1. Description of DES Section 15.2. Interface for DES Section 15.3. Implementation and Analysis of DES Section 15.4. DES Example: Block Cipher Modes Section 15.5. Description of RSA Section 15.6. Interface for RSA Section 15.7. Implementation and Analysis of RSA Section 15.8. Questions and Answers Section 15.9. Related Topics Chapter 16. Graph Algorithms Section 16.1. Description of Minimum Spanning Trees Section 16.2. Interface for Minimum Spanning Trees Section 16.3. Implementation and Analysis of Minimum Spanning Trees Section 16.4. Description of Shortest Paths Section 16.5. Interface for Shortest Paths Section 16.6. Implementation and Analysis of Shortest Paths Section 16.7. Shortest Paths Example: Routing Tables Section 16.8. Description of the Traveling-Salesman Problem Section 16.9. Interface for the Traveling-Salesman Problem Section 16.10. Implementation and Analysis of the Traveling-Salesman Problem Section 16.11. Questions and Answers Section 16.12. Related Topics Chapter 17. Geometric Algorithms Section 17.1. Description of Testing Whether Line Segments Intersect Section 17.2. Interface for Testing Whether Line Segments Intersect Section 17.3. Implementation and Analysis of Testing Whether Line Segments Intersect Section 17.4. Description of Convex Hulls Section 17.5. Interface for Convex Hulls Section 17.6. Implementation and Analysis of Convex Hulls Section 17.7. Description of Arc Length on Spherical Surfaces Section 17.8. Interface for Arc Length on Spherical Surfaces Section 17.9. Implementation and Analysis of Arc Length on Spherical Surfaces Section 17.10. Arc Length Example: Approximating Distances on Earth Section 17.11. Questions and Answers Section 17.12. Related Topics ...展开收缩
(系统自动生成,下载前可以参看下载内容)
下载文件列表
相关说明
- 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
- 本站是交换下载平台，提供交流渠道，下载内容来自于网络，除下载问题外，其它问题请自行百度。
- 本站已设置防盗链，请勿用迅雷、QQ旋风等多线程下载软件下载资源，下载后用WinRAR最新版进行解压.
- 如果您发现内容无法下载，请稍后再次尝试；或者到消费记录里找到下载记录反馈给我们.
- 下载后发现下载的内容跟说明不相乎，请到消费记录里找到下载记录反馈给我们，经确认后退回积分.
- 如下载前有疑问，可以通过点击"提供者"的名字，查看对方的联系方式，联系对方咨询.
