Chapter 1 Introduction to Data Structures and Algorithms¶
Chapter 2 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
Chapter 3 Linked List and Stack¶
Chapter 4 Sorting¶
- 4.1. Chapter Introduction: Sorting
- 4.2. Sorting Terminology and Notation
- 4.3. Insertion Sort
- 4.4. Bubble Sort
- 4.5. Selection Sort
- 4.6. The Cost of Exchange Sorting
- 4.7. Optimizing Sort Algorithms with Code Tuning
- 4.8. Shellsort
- 4.9. Mergesort Concepts
- 4.10. Implementing Mergesort
- 4.11. Quicksort
- 4.12. Heapsort
- 4.13. Binsort
- 4.14. Radix Sort
- 4.15. An Empirical Comparison of Sorting Algorithms
- 4.16. Lower Bounds for Sorting
- 4.17. Sorting Summary Exercises
- 4.18. Sorting Chapter Programming Exercises [SB]
Chapter 5 Recursion and Dynamic Programming¶
- 5.1. Introduction
- 5.2. Writing a recursive function
- 5.3. Code Completion Practice Exercises
- 5.3.1. Introduction
- 5.3.2. Recursion Programming Exercise: Largest
- 5.3.3. Recursion Programming Exercise: Multiply
- 5.3.4. Recursion Programming Exercise: GCD
- 5.3.5. Recursion Programming Exercise: log
- 5.3.6. Recursion Programming Exercise: Cummulative Sum
- 5.3.7. Recursion Programming Exercise: Add odd values
- 5.3.8. Recursion Programming Exercise: Sum Of the Digits
- 5.3.9. Recursion Programming Exercise: Count Characters
- 5.4. Writing More Sophisticated Recursive Functions
- 5.5. Harder Code Completion Practice Exercises
- 5.6. Writing Practice Exercises
- 5.7. Tracing Recursive Code
- 5.8. Tracing Practice Exercises
- 5.9. Recursion Summary Exercises
- 5.10. Dynamic Programming
Chapter 6 Hash Table and Queue¶
- 6.1. Introduction
- 6.2. Hash Function Principles
- 6.3. Sample Hash Functions
- 6.4. Open Hashing
- 6.5. Bucket Hashing
- 6.6. Collision Resolution
- 6.7. Improved Collision Resolution
- 6.8. Analysis of Closed Hashing
- 6.9. Deletion
- 6.10. Hashing Chapter Summary Exercises
- 6.11. Queues
- 6.12. Linked Queues
- 6.13. Linear Structure Summary Exercises
Chapter 7 Searching¶
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.7.1. Information Flow in Recursive Functions
- 8.7.2. Binary Tree Set Depth Exercise
- 8.7.3. Collect-and-return
- 8.7.4. Binary Tree Check Sum Exercise
- 8.7.5. Binary Tree Leaf Nodes Count Exercise
- 8.7.6. Binary Tree Sum Nodes Exercise
- 8.7.7. Combining Information Flows
- 8.7.8. Binary Tree Check Value Exercise
- 8.7.9. Combination Problems
- 8.7.10. Binary Tree Height Exercise
- 8.7.11. Binary Tree Get Difference Exercise
- 8.7.12. Binary Tree Has Path Sum Exercise
- 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. Binary Tree Chapter Summary
Chapter 9 General Trees¶
Chapter 10 Graphs¶
Chapter 11 Advanced Data Structures¶
Chapter 12 Programming Tutorials¶
- 12.1. Command Line Basics
- 12.2. Parsing Command Line Parameters In Your Program
- 12.3. Using Command Line Parameters in Eclipse
- 12.4. Installing the Web-CAT Submission Plug-in for Eclipse
- 12.5. Common Debugging Methods
- 12.6. Debugging In Eclipse
- 12.7. Reading Input (from Files or Otherwise)
- 12.8. Random Access Files In Java
- 12.9. JUnit Testing And You
- 12.10. Writing JUnit Tests
- 12.11. Code Coverage In JUnit
- 12.12. Testing
- 12.13. Testing for Code Coverage
- 12.14. Another Example
- 12.15. Bowling Example
