Chapter 0 Preface¶
Chapter 1 Introduction for Data Structures and Algorithms Courses¶
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
- 2.15. Algorithm Analysis Summary Exercises
Chapter 3 Introduction to Pointers in Java¶
- 3.1. Pointers Chapter Introduction
- 3.2. Basic References Part 1
- 3.3. Basic References Part 2
- 3.4. Pointers Syntax
- 3.5. Local Memory
- 3.6. Heap Memory
- 3.7. Link Nodes
- 3.8. Link Nodes Practice Exercises
- 3.9. Additional Practice Exercises
- 3.10. Pointers Concepts Summary
- 3.11. Practice Exercises
- 3.11.1. JHAVEPOPEx1
- 3.11.2. JHAVEPOPEx2
- 3.11.3. JHAVEPOPEx3
- 3.11.4. JHAVEPOPEx4
- 3.11.5. JHAVEPOPEx5
- 3.11.6. JHAVEPOPEx6
- 3.11.7. JHAVEPOPEx7
- 3.11.8. JHAVEPOPEx8
- 3.11.9. JHAVEPOPEx9
- 3.11.10. JHAVEPOPEx10
- 3.11.11. JHAVEPOPEx11
- 3.11.12. JHAVEPOPEx12
- 3.11.13. JHAVEPOPEx13
- 3.11.14. JHAVEPOPEx14
- 3.11.15. JHAVEPOPEx15
- 3.11.16. JHAVEPOPEx16
- 3.11.17. JHAVEPOPEx17
- 3.11.18. JHAVEPOPEx18
- 3.12. More Practice Exercises
- 3.12.1. AddNodeAfterRef7
- 3.12.2. ChangeHeadNodeValue
- 3.12.3. ConcatenateTwoLists
- 3.12.4. DeleteNode
- 3.12.5. FirstNodeEqualsValue
- 3.12.6. InsertListAfterRef13
- 3.12.7. InsertListInMiddle
- 3.12.8. LastNodeParam5
- 3.12.9. LastNodeRef1
- 3.12.10. LoopInChain15
- 3.12.11. MiddleNodeRef3
- 3.12.12. ReferenceSecondLastNode
- 3.12.13. ReferenceValueNode
- 3.12.14. RemoveRefNext9
- 3.12.15. ReverseUpToRef11
Chapter 4 Linear Structures¶
Chapter 5 Stacks and Queues¶
Chapter 6 Recursion¶
- 6.1. Introduction
- 6.2. Writing a recursive function
- 6.3. Code Completion Practice Exercises
- 6.3.1. Introduction
- 6.3.2. Recursion Programming Exercise: Largest
- 6.3.3. Recursion Programming Exercise: Multiply
- 6.3.4. Recursion Programming Exercise: GCD
- 6.3.5. Recursion Programming Exercise: log
- 6.3.6. Recursion Programming Exercise: Cummulative Sum
- 6.3.7. Recursion Programming Exercise: Add odd values
- 6.3.8. Recursion Programming Exercise: Sum Of the Digits
- 6.3.9. Recursion Programming Exercise: Count Characters
- 6.4. Writing More Sophisticated Recursive Functions
- 6.5. Harder Code Completion Practice Exercises
- 6.6. Writing Practice Exercises
- 6.7. Tracing Recursive Code
- 6.8. Tracing Practice Exercises
- 6.9. Implementing Recursion
- 6.10. Summary Exercises
Chapter 7 Searching and Sorting¶
- 7.1. Searching in an Array
- 7.2. Chapter Introduction: Sorting
- 7.3. Sorting Terminology and Notation
- 7.4. Bubble Sort
- 7.5. Insertion Sort
- 7.6. Selection Sort
- 7.7. The Cost of Exchange Sorting
- 7.8. Optimizing Sort Algorithms with Code Tuning
- 7.9. Mergesort Concepts
- 7.10. Implementing Mergesort
- 7.11. Quicksort
- 7.12. Heapsort
- 7.13. Binsort
- 7.14. Radix Sort
- 7.15. An Empirical Comparison of Sorting Algorithms
- 7.16. Sorting Summary Exercises
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. Binary Tree Traversals
- 8.5. Implementing Tree Traversals
- 8.6. Information Flow in Recursive Functions
- 8.6.1. Information Flow in Recursive Functions
- 8.6.2. Binary Tree Set Depth Exercise
- 8.6.3. Collect-and-return
- 8.6.4. Binary Tree Check Sum Exercise
- 8.6.5. Binary Tree Leaf Nodes Count Exercise
- 8.6.6. Binary Tree Sum Nodes Exercise
- 8.6.7. Combining Information Flows
- 8.6.8. Binary Tree Check Value Exercise
- 8.6.9. Combination Problems
- 8.6.10. Binary Tree Height Exercise
- 8.6.11. Binary Tree Get Difference Exercise
- 8.6.12. Binary Tree Has Path Sum Exercise
- 8.7. Binary Tree Node Implementations
- 8.8. Binary Tree Space Requirements
- 8.9. Binary Search Trees
- 8.10. Binary Tree Guided Information Flow
- 8.11. Array Implementation for Complete Binary Trees
- 8.12. Heaps and Priority Queues
- 8.13. Binary Tree Chapter Summary
Chapter 9 Search Structures¶
Chapter 10 Graphs¶
Chapter 11 Hashing¶
Chapter 12 Programming Tutorials¶
- 12.1. Using Parameters in Eclipse
- 12.2. Common Debugging Methods
- 12.3. Debugging In Eclipse
- 12.4. Reading Input (from Files or Otherwise)
- 12.5. Random Access Files In Java
- 12.6. JUnit Testing And You
- 12.7. Writing JUnit Tests
- 12.8. Code Coverage In JUnit
- 12.9. Testing
- 12.10. Testing for Code Coverage
- 12.11. Another Example
- 12.12. Bowling Example
