دانلود کتاب Mastering Algorithms with C

فهرست مطالب :

Mastering Algorithms with C
Preface
PartII
PartIII
Key Features
About the Code
Conventions
How to Contact Us
Acknowledgments
I. Preliminaries
1.2. An Introduction to Algorithms
1.2.1.2. Divide-and-conquer algorithms
1.2.1.3. Dynamic-programming solutions
1.2.1.4. Greedy algorithms
1.2.1.5. Approximation algorithms
1.3. A Bit About Software Engineering
1.4. How to Use This Book
2. Pointer Manipulation
2.2. Storage Allocation
2.3. Aggregates and Pointer Arithmetic
2.3.2. Arrays
2.4. Pointers as Parameters to Functions
2.4.2. Pointers to Pointers as Parameters. 2.5. Generic Pointers and Casts2.5.2. Casts
2.6. Function Pointers
2.7. Questions and Answers
2.8. Related Topics
3. Recursion
3.2. Tail Recursion
3.3. Questions and Answers
3.4. Related Topics
4. Analysis of Algorithms
4.2. O-Notation
4.2.2. O-Notation Example and Why It Works
4.3. Computational Complexity
4.4. Analysis Example: Insertion Sort
4.5. Questions and Answers
4.6. Related Topics
II. Data Structures
5.2. Interface for.