Chapter 0 Preface¶
Chapter 1 Introduction¶
Chapter 2 Mathematical Background¶
Chapter 3 Algorithm Analysis¶
- 3.1. Chapter Introduction
- 3.2. Problems, Algorithms, and Programs
- 3.3. Comparing Algorithms
- 3.4. Best, Worst, and Average Cases
- 3.5. Faster Computer, or Faster Algorithm?
- 3.6. Asymptotic Analysis and Upper Bounds
- 3.7. Lower Bounds and \(\Theta\) Notation
- 3.8. Calculating Program Running Time
- 3.9. Analyzing Problems
- 3.10. Common Misunderstandings
- 3.11. Amortized Analysis
- 3.12. Multiple Parameters
- 3.13. Space Bounds
- 3.14. Code Tuning and Empirical Analysis
- 3.15. Algorithm Analysis Summary Exercises
- 3.16. Algorithm Analysis Summary Exercises
Chapter 4 Linear Structures¶
- 4.1. Abstract Data Types
- 4.2. Chapter Introduction: Lists
- 4.3. A List ADT
- 4.4. Array-Based List Implementation
- 4.5. Linked Lists
- 4.6. Comparison of List Implementations
- 4.7. Doubly Linked Lists
- 4.8. List Element Implementations
- 4.9. Stacks
- 4.10. Linked Stacks
- 4.11. Implementing Recursion
- 4.12. Queues
- 4.13. Linked Queues
- 4.14. Linear Structure Summary Exercises
Chapter 5 Design¶
Chapter 6 Binary Trees¶
- 6.1. Binary Trees Chapter Introduction
- 6.2. Binary Trees
- 6.3. Binary Tree as a Recursive Data Structure
- 6.4. The Full Binary Tree Theorem
- 6.5. Binary Tree Traversals
- 6.6. Implementing Tree Traversals
- 6.7. Binary Tree Node Implementations
- 6.8. Composite-based Expression Tree
- 6.9. Binary Tree Space Requirements
- 6.10. Binary Search Trees
- 6.11. Dictionary Implementation Using a BST
- 6.12. Array Implementation for Complete Binary Trees
- 6.13. Heaps and Priority Queues
- 6.14. Huffman Coding Trees
- 6.15. Trees versus Tries
- 6.16. Proof of Optimality for Huffman Coding
- 6.17. Binary Tree Chapter Summary
Chapter 7 Balanced Trees¶
Chapter 8 General Trees¶
Chapter 9 Indexing¶
Chapter 10 Hashing¶
Chapter 11 Graphs¶
Chapter 12 Sorting¶
- 12.1. Chapter Introduction: Sorting
- 12.2. Sorting Terminology and Notation
- 12.3. Insertion Sort
- 12.4. Bubble Sort
- 12.5. Selection Sort
- 12.6. The Cost of Exchange Sorting
- 12.7. Optimizing Sort Algorithms with Code Tuning
- 12.8. Shellsort
- 12.9. Mergesort Concepts
- 12.10. Implementing Mergesort
- 12.11. Quicksort
- 12.12. Heapsort
- 12.13. Binsort
- 12.14. Radix Sort
- 12.15. An Empirical Comparison of Sorting Algorithms
- 12.16. Lower Bounds for Sorting
- 12.17. Sorting Summary Exercises
