Chapter 0 Preface¶
Chapter 1 Introduction¶
Chapter 2 Object-Oriented Programming¶
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¶
Chapter 5 List Interface & Array-based Lists¶
Chapter 6 Linked Lists¶
Chapter 7 Stacks¶
Chapter 8 Queues¶
Chapter 9 Binary Trees¶
- 9.1. Binary Trees Chapter Introduction
- 9.2. Binary Trees
- 9.3. The Full Binary Tree Theorem
- 9.4. Binary Tree Traversals
- 9.5. Implementing Tree Traversals
- 9.6. Information Flow in Recursive Functions
- 9.7. Binary Tree Node Implementations
- 9.8. Binary Search Trees
- 9.9. Binary Tree Guided Information Flow
- 9.10. Multiple Binary Trees
- 9.11. A Hard Information Flow Problem
- 9.12. Array Implementation for Complete Binary Trees
- 9.13. Heaps and Priority Queues
- 9.14. Huffman Coding Trees
- 9.15. Trees versus Tries
- 9.16. Proof of Optimality for Huffman Coding
- 9.17. Binary Tree Chapter Summary
Chapter 10 Sorting¶
- 10.1. Chapter Introduction: Sorting
- 10.2. Sorting Terminology and Notation
- 10.3. Insertion Sort
- 10.4. Bubble Sort
- 10.5. Selection Sort
- 10.6. The Cost of Exchange Sorting
- 10.7. Optimizing Sort Algorithms with Code Tuning
- 10.8. Mergesort Concepts
- 10.9. Implementing Mergesort
- 10.10. Quicksort
- 10.11. Heapsort
