Introduction¶
Algorithm Analysis¶
- -1.1. Chapter Introduction
- -1.2. Problems, Algorithms, and Programs
- -1.3. Comparing Algorithms
- -1.4. Best, Worst, and Average Cases
- -1.5. Faster Computer, or Faster Algorithm?
- -1.6. Asymptotic Analysis and Upper Bounds
- -1.7. Lower Bounds and \(\Theta\) Notation
- -1.8. Calculating Program Running Time
- -1.9. Analyzing Problems
- -1.10. Common Misunderstandings
- -1.11. Multiple Parameters
- -1.12. Space Bounds
- -1.13. Code Tuning and Empirical Analysis
- -1.14. Algorithm Analysis Summary Exercises
- -1.15. Algorithm Analysis Summary Exercises
Lists and Stacks¶
Sorting¶
- -1.1. Chapter Introduction: Sorting
- -1.2. Sorting Terminology and Notation
- -1.3. Insertion Sort
- -1.4. Bubble Sort
- -1.5. Selection Sort
- -1.6. The Cost of Exchange Sorting
- -1.7. Optimizing Sort Algorithms with Code Tuning
- -1.8. Shellsort
- -1.9. Mergesort Concepts
- -1.10. Implementing Mergesort
- -1.11. Quicksort
- -1.12. Heapsort
- -1.13. Binsort
- -1.14. Radix Sort
- -1.15. An Empirical Comparison of Sorting Algorithms
- -1.16. Lower Bounds for Sorting
- -1.17. Sorting Summary Exercises
Hashing and Queues¶
- -1.1. Introduction
- -1.2. Hash Function Principles
- -1.3. Sample Hash Functions
- -1.4. Open Hashing
- -1.5. Bucket Hashing
- -1.6. Collision Resolution
- -1.7. Improved Collision Resolution
- -1.8. Analysis of Closed Hashing
- -1.9. Deletion
- -1.10. Hashing Chapter Summary Exercises
- -1.11. Queues
- -1.12. Linked Queues
- -1.13. Linear Structure Summary Exercises
Searching¶
Recursion¶
- -1.1. Introduction
- -1.2. Writing a recursive function
- -1.3. Code Completion Practice Exercises
- -1.3.1. Introduction
- -1.3.2. Recursion Programming Exercise: Largest
- -1.3.3. Recursion Programming Exercise: Multiply
- -1.3.4. Recursion Programming Exercise: GCD
- -1.3.5. Recursion Programming Exercise: log
- -1.3.6. Recursion Programming Exercise: Cummulative Sum
- -1.3.7. Recursion Programming Exercise: Add odd values
- -1.3.8. Recursion Programming Exercise: Sum Of the Digits
- -1.3.9. Recursion Programming Exercise: Count Characters
- -1.4. Writing More Sophisticated Recursive Functions
- -1.5. Tracing Recursive Code
- -1.6. Tracing Practice Exercises
- -1.7. Summary Exercises
Dynamic Programming¶
Binary Trees¶
- -1.1. Binary Trees Chapter Introduction
- -1.2. Binary Trees
- -1.3. Binary Tree as a Recursive Data Structure
- -1.4. The Full Binary Tree Theorem
- -1.5. Binary Tree Traversals
- -1.6. Implementing Tree Traversals
- -1.7. Binary Tree Node Implementations
- -1.8. Binary Tree Space Requirements
- -1.9. Binary Search Trees
- -1.10. Dictionary Implementation Using a BST
- -1.11. Array Implementation for Complete Binary Trees
- -1.12. Heaps and Priority Queues
- -1.13. Binary Tree Chapter Summary
General Trees¶
Graphs¶
Design¶
Programming Tutorials¶
- -1.1. Introduction to Object-Oriented Programming
- -1.2. Software Development Processes
- -1.3. The Unified Modeling Language
- -1.4. Command Line Basics
- -1.5. Parsing Command Line Parameters In Your Program
- -1.6. Using Command Line Parameters in Eclipse
- -1.7. Installing the Web-CAT Submission Plug-in for Eclipse
- -1.8. Common Debugging Methods
- -1.9. Debugging In Eclipse
- -1.10. Reading Input (from Files or Otherwise)
- -1.11. Random Access Files In Java
- -1.12. JUnit Testing And You
- -1.13. Writing JUnit Tests
- -1.14. Code Coverage In JUnit
- -1.15. Mutation Coverage In JUnit
- -1.16. Mutation Testing Examples
- -1.16.1. Types of Mutants
- -1.16.1.1. Arithmetic Operation Mutant
- -1.16.1.2. Example Code 1: Arithmetic Operation Mutant
- -1.16.1.3. Logical Expression Mutant (Remove Conditionals)
- -1.16.1.4. Example Code 2: Logical Expression Mutant (Remove Conditionals)
- -1.16.1.5. Example Code 3: Multiple Mutants in One (EvenOddCheck)
- -1.16.1.6. Example Code 4: Loop Conditions (optional)
- -1.16.1. Types of Mutants
- -1.17. Mutation Coverage: FAQ
- -1.17.1. Frequently Asked Questions
- -1.17.1.1. What is Mutation Testing and why should I use it?
- -1.17.1.2. Does 100% Mutation Score mean 100% Project Correctness?
- -1.17.1.3. Why does writing Mutation Tests take so much time?
- -1.17.1.4. Why should I use Mutation Testing instead of Code Coverage?
- -1.17.1.5. Why are we using this particular set of mutation operators?
- -1.17.1.6. Does 100% Mutation Score mean my code is perfect?
- -1.17.1.7. Why do I have bugs in my code despite having 100% Mutation Score?
- -1.17.1.8. Why do my mutation tests not cover all branches of my code?
- -1.17.1.9. How do I localize the bugs in my code?
- -1.17.1.10. How do I recover the “Mutation List”/”Mutation Summary” tabs?
- -1.17.1. Frequently Asked Questions
- -1.18. Testing
- -1.19. Testing for Code Coverage
- -1.20. Another Example
- -1.21. Bowling Example
