Chapter 0 Preface¶
Chapter 1 Introduction¶
Chapter 2 Mathematical Background¶
Chapter 3 Recursion¶
- 3.1. Introduction
- 3.2. Writing a recursive function
- 3.3. Code Completion Practice Exercises
- 3.3.1. Programming Exercise: Largest
- 3.3.2. Programming Exercise: Multiply
- 3.3.3. Programming Exercise: GCD
- 3.3.4. Programming Exercise: Logs
- 3.3.5. Programming Exercise: Cummulative Sum
- 3.3.6. Programming Exercise: Array Sum
- 3.3.7. Programming Exercise: Digits Sum
- 3.3.8. Programming Exercise: Characters
- 3.4. Writing More Sophisticated Recursive Functions
- 3.5. Harder Code Completion Practice Exercises
- 3.6. Writing Practice Exercises
- 3.7. Tracing Recursive Code
- 3.8. Tracing Practice Exercises
- 3.9. Summary Exercises
Chapter 4 Algorithm Analysis¶
- 4.1. Chapter Introduction
- 4.2. Problems, Algorithms, and Programs
- 4.3. Comparing Algorithms
- 4.4. Best, Worst, and Average Cases
- 4.5. Faster Computer, or Faster Algorithm?
- 4.6. Asymptotic Analysis and Upper Bounds
- 4.7. Lower Bounds and \(\Theta\) Notation
- 4.8. Calculating Program Running Time
- 4.9. Analyzing Problems
- 4.10. Common Misunderstandings
- 4.11. Multiple Parameters
- 4.12. Space Bounds
- 4.13. Code Tuning and Empirical Analysis
- 4.14. Algorithm Analysis Summary Exercises
Chapter 5 Object-Oriented Programming¶
Chapter 6 Linear Structures¶
- 6.1. Chapter Introduction: Lists
- 6.2. The List ADT
- 6.3. Array-Based List Implementation
- 6.4. Linked Lists
- 6.5. Comparison of List Implementations
- 6.6. Doubly Linked Lists
- 6.7. List Element Implementations
- 6.8. Stacks
- 6.9. Linked Stacks
- 6.10. Freelists
- 6.11. Implementing Recursion
- 6.12. Queues
- 6.13. Linked Queues
- 6.14. Linear Structure Summary Exercises
Chapter 7 Design¶
Chapter 8 Binary Trees¶
- 8.1. Binary Trees Chapter Introduction
- 8.2. Binary Trees
- 8.3. Binary Tree as a Recursive Data Structure
- 8.4. The Full Binary Tree Theorem
- 8.5. Binary Tree Traversals
- 8.6. Implementing Tree Traversals
- 8.7. Information Flow in Recursive Functions
- 8.8. Binary Tree Node Implementations
- 8.9. Composite-based Expression Tree
- 8.10. Binary Tree Space Requirements
- 8.11. Binary Search Trees
- 8.12. Dictionary Implementation Using a BST
- 8.13. Binary Tree Guided Information Flow
- 8.14. Multiple Binary Trees
- 8.15. A Hard Information Flow Problem
- 8.16. Array Implementation for Complete Binary Trees
- 8.17. Heaps and Priority Queues
- 8.18. Huffman Coding Trees
- 8.19. Trees versus Tries
- 8.20. Proof of Optimality for Huffman Coding
- 8.21. Binary Tree Chapter Summary
Chapter 9 Graphs¶
Chapter 10 Memory Management¶
Chapter 11 Sorting¶
- 11.1. Chapter Introduction: Sorting
- 11.2. Sorting Terminology and Notation
- 11.3. Insertion Sort
- 11.4. Bubble Sort
- 11.5. Selection Sort
- 11.6. The Cost of Exchange Sorting
- 11.7. Optimizing Sort Algorithms with Code Tuning
- 11.8. Shellsort
- 11.9. Mergesort Concepts
- 11.10. Implementing Mergesort
- 11.11. Quicksort
- 11.12. Heapsort
- 11.13. Binsort
- 11.14. Radix Sort
- 11.15. An Empirical Comparison of Sorting Algorithms
- 11.16. Lower Bounds for Sorting
- 11.17. Sorting Summary Exercises
