Preface¶
Introduction¶
Algorithm Analysis¶
- 2.1. Chapter Introduction
- 2.2. Problems, Algorithms, and Programs
- 2.3. Comparing Algorithms
- 2.4. Best, Worst, and Average Cases
- 2.5. Faster Computer, or Faster Algorithm?
- 2.6. Asymptotic Analysis and Upper Bounds
- 2.7. Lower Bounds and \(\Theta\) Notation
- 2.8. Calculating Program Running Time
- 2.9. Analyzing Problems
- 2.10. Common Misunderstandings
- 2.11. Multiple Parameters
- 2.12. Space Bounds
- 2.13. Code Tuning and Empirical Analysis
- 2.14. Algorithm Analysis Summary Exercises
Linear Structures¶
- 3.1. Chapter Introduction: Lists
- 3.2. The List ADT
- 3.3. Array-Based List Implementation
- 3.4. Linked Lists
- 3.5. Comparison of List Implementations
- 3.6. Doubly Linked Lists
- 3.7. List Element Implementations
- 3.8. Stacks
- 3.9. Linked Stacks
- 3.10. Freelists
- 3.11. Implementing Recursion
- 3.12. Queues
- 3.13. Linked Queues
- 3.14. Linear Structure Summary Exercises
Design¶
Binary Trees¶
- 5.1. Binary Trees Chapter Introduction
- 5.2. Binary Trees
- 5.3. Binary Tree as a Recursive Data Structure
- 5.4. The Full Binary Tree Theorem
- 5.5. Binary Tree Traversals
- 5.6. Implementing Tree Traversals
- 5.7. Information Flow in Recursive Functions
- 5.7.1. Information Flow in Recursive Functions
- 5.7.2. Binary Tree Set Depth Exercise
- 5.7.3. Collect-and-return
- 5.7.4. Binary Tree Check Sum Exercise
- 5.7.5. Binary Tree Leaf Nodes Count Exercise
- 5.7.6. Binary Tree Sum Nodes Exercise
- 5.7.7. Combining Information Flows
- 5.7.8. Binary Tree Check Value Exercise
- 5.7.9. Combination Problems
- 5.7.10. Binary Tree Height Exercise
- 5.7.11. Binary Tree Get Difference Exercise
- 5.7.12. Binary Tree Has Path Sum Exercise
- 5.8. Binary Tree Node Implementations
- 5.9. Composite-based Expression Tree
- 5.10. Binary Tree Space Requirements
- 5.11. Binary Search Trees
- 5.12. Dictionary Implementation Using a BST
- 5.13. Binary Tree Guided Information Flow
- 5.14. Multiple Binary Trees
- 5.15. A Hard Information Flow Problem
- 5.16. Array Implementation for Complete Binary Trees
- 5.17. Heaps and Priority Queues
- 5.18. Huffman Coding Trees
- 5.19. Trees versus Tries
- 5.20. Proof of Optimality for Huffman Coding
- 5.21. Binary Tree Chapter Summary
Sorting¶
- 6.1. Chapter Introduction: Sorting
- 6.2. Sorting Terminology and Notation
- 6.3. Insertion Sort
- 6.4. Bubble Sort
- 6.5. Selection Sort
- 6.6. The Cost of Exchange Sorting
- 6.7. Optimizing Sort Algorithms with Code Tuning
- 6.8. Shellsort
- 6.9. Mergesort Concepts
- 6.10. Implementing Mergesort
- 6.11. Quicksort
- 6.12. Heapsort
- 6.13. Binsort
- 6.14. Radix Sort
- 6.15. An Empirical Comparison of Sorting Algorithms
- 6.16. Lower Bounds for Sorting
- 6.17. Sorting Summary Exercises
