Chapter 0 Introduction¶
Chapter 1 Mathematical Background¶
Chapter 2 Linear Structures¶
- 2.1. Chapter Introduction: Lists
- 2.2. The List ADT
- 2.3. Array-Based List Implementation
- 2.4. Linked Lists
- 2.5. Comparison of List Implementations
- 2.6. Doubly Linked Lists
- 2.7. List Element Implementations
- 2.8. Stacks
- 2.9. Linked Stacks
- 2.10. Freelists
- 2.11. Queues
- 2.12. Linked Queues
- 2.13. Linear Structure Summary Exercises
Chapter 3 Recursion¶
- 3.1. Introduction
- 3.2. Writing a recursive function
- 3.3. Code Completion Practice Exercises
- 3.3.1. Introduction
- 3.3.2. Recursion Programming Exercise: Largest
- 3.3.3. Recursion Programming Exercise: Multiply
- 3.3.4. Recursion Programming Exercise: GCD
- 3.3.5. Recursion Programming Exercise: log
- 3.3.6. Recursion Programming Exercise: Cummulative Sum
- 3.3.7. Recursion Programming Exercise: Add odd positions
- 3.3.8. Recursion Programming Exercise: Sum Of the Digits
- 3.3.9. Recursion Programming Exercise: Count Characters
- 3.4. Writing More Sophisticated Recursive Functions
- 3.5. Harder Code Completion Practice Exercises
- 3.6. Writing Practice Exercises
- 3.7. Implementing Recursion
- 3.8. Tracing Recursive Code
- 3.9. Tracing Practice Exercises
- 3.10. 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. Calculating Program Running Time
- 4.8. Analyzing Problems
- 4.9. Common Misunderstandings
- 4.10. Multiple Parameters
- 4.11. Space Bounds
- 4.12. Code Tuning and Empirical Analysis
- 4.13. Solving Recurrence Relations
- 4.14. Algorithm Analysis Summary Exercises
- 4.15. Algorithm Analysis Summary Exercises
Chapter 5 Sorting¶
- 5.1. Chapter Introduction: Sorting
- 5.2. Sorting Terminology and Notation
- 5.3. Insertion Sort
- 5.4. Bubble Sort
- 5.5. Selection Sort
- 5.6. The Cost of Exchange Sorting
- 5.7. Optimizing Sort Algorithms with Code Tuning
- 5.8. Shellsort
- 5.9. Mergesort Concepts
- 5.10. Implementing Mergesort
- 5.11. Quicksort
- 5.12. Heapsort
- 5.13. Binsort
- 5.14. Radix Sort
- 5.15. An Empirical Comparison of Sorting Algorithms
- 5.16. Lower Bounds for Sorting
- 5.17. Sorting Summary Exercises
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. Binary Tree Node Implementations
- 6.7. Composite-based Expression Tree
- 6.8. Binary Tree Space Requirements
- 6.9. Binary Search Trees
- 6.10. Dictionary Implementation Using a BST
- 6.11. Array Implementation for Complete Binary Trees
- 6.12. Heaps and Priority Queues
Chapter 7 General Trees¶
Chapter 8 Search structures¶
- 8.1. Chapter Introduction: Search
- 8.2. Analyzing Search in Unsorted Lists
- 8.3. Search in Sorted Arrays
- 8.4. Self-Organizing Lists
- 8.5. Bit Vectors for Representing Sets
- 8.6. Balanced Trees
- 8.7. The AVL Tree
- 8.8. The Splay Tree
- 8.9. The Red-Black Tree
- 8.10. Indexing Chapter Introduction
- 8.11. Linear Indexing
- 8.12. ISAM
- 8.13. Tree-based Indexing
- 8.14. 2-3 Trees
- 8.15. B-Trees
