Code Fragments

Chapter 1: Java Programming Basics

• 1.1 Counter-Count
• 1.1 Counter-End
• 1.2 Base-Base
• 1.3 Gnome-Vars
• 1.3 Gnome-Gnome
• 1.4 DayTripper-Enum
• 1.5 DayTripper-Switch
• 1.5 ArrayTest-Sum
• 1.5 ArrayTest-FindCount
• 1.5 ArrayTest-CheckBounds
• 1.5 ArrayTest-Declare2
• 1.5 ArrayTest-Declare
• 1.5 InputExample-Scanner
• 1.5 InputExample-Int
• 1.5 CreditCard-CreditCard
• 1.6 Test-CreditTest
• 1.7 output2-credit
• 1.8 XYPoint-Javadoc
• A.1 DayTripper-Enum
• A.2 InputExample-Scanner
• A.2 InputExample-Int

Chapter 2: Object-Oriented Design

• 2.1 ThisTester-class
• 2.2 Progression-Progress
• 2.3 ArithProgression-Arith
• 2.4 GeomProgression-Geom
• 2.5 FibonacciProgression-Fib
• 2.6 TestProgression-class
• 2.8 DesignExamples-exception
• 2.8 DesignExamples-shopping
• 2.8 DesignExamples-ready
• 2.8 DesignExamples-catch
• 2.8 DesignExamples-error
• 2.8 DesignExamples-catch2
• 2.8 Sellable-Sellable
• 2.9 Photograph-Photograph
• 2.10 Transportable-Transportable
• 2.11 BoxedItem-BoxedItem
• 2.12 InsurableItem-interface
• 2.12 BoxedItem2-class
• 2.12 DesignExamples-widening
• 2.12 DesignExamples-narrowing
• 2.12 DesignExamples-cast
• 2.12 DesignExamples-cast2
• 2.12 Person-Person
• 2.13 Student-Student
• 2.14 PersonPairDirectory-PersonPairDirectory
• 2.15 TestDirectory-wrong
• 2.15 TestDirectory-right
• 2.15 Pair-class
• 2.16 Pair-output
• 2.16 PersonPairDirectoryGeneric-class
• 2.16 TestDirectory-variable
• 2.16 TestDirectory-generic
• 2.16 PersonPairDirectoryGeneric-compare
• 2.16 PersonPairDirectoryGeneric-main
• 2.16 Maryland-Maryland
• A.2 Pair-class
• A.3 Pair-output
• A.3 PersonPairDirectoryGeneric-class
• A.3 TestDirectory-variable
• A.3 TestDirectory-generic
• A.3 PersonPairDirectoryGeneric-compare
• A.3 PersonPairDirectoryGeneric-main

Chapter 3: Arrays, Linked Lists, and Recursion

• 3.1 GameEntry-GameEntry
• 3.2 Scores-Scores
• 3.3 Scores-Insert
• 3.4 Scores-Remove
• 3.7 ArrayTest-InsertionSort
• 3.8 ArrayTest-Util
• 3.9 Caesar-Cipher
• 3.10 ArrayTest-TwoD
• 3.10 ArrayTest-Syntax
• 3.10 TicTacToe-TTT1
• 3.11 TicTacToe-TTT2
• 3.12 Node-Node
• 3.13 SLinkedList-LL
• 3.17 DNode-Node
• 3.22 DList-Header
• 3.23 DList-Trailer
• 3.24 DList-Conv
• 3.25 CircleList-Circle
• 3.26 CircleList-Duck
• 3.28 GenericSort-Sort
• 3.29 Factorial-Recursive
• 3.30 Ruler-Ruler

Chapter 5: Stacks and Queues

• 5.1 EmptyStackException-EmptyStackException
• 5.2 Stack-Stack
• 5.4 ArrayStack-ArrayStack
• 5.5 ArrayStack-ArrayStack2
• 5.6 Node-Node
• 5.7 NodeStack-NodeStack
• 5.8 StackExamples-reverse
• 5.9 StackExamples-main
• 5.11 HTML-HTML
• 5.12 HTML-HTML2
• 5.13 Queue-Queue
• 5.15 NodeQueue-enqueue
• 5.15 NodeQueue-dequeue
• 5.16 Josephus-Josephus
• 5.17 Deque-Deque
• 5.18 NodeDeque-NodeDeque
• 5.18 NodeDeque-size
• 5.18 NodeDeque-isEmpty
• 5.18 NodeDeque-first
• 5.18 NodeDeque-addFirst
• 5.18 NodeDeque-removeLast
• 5.18 NodeDeque-tail

Chapter 6: Lists and Iterators

• 6.2 IndexList-Header
• 6.2 IndexList-List
• 6.2 IndexList-Tail
• 6.3 ArrayIndexList-vector
• 6.4 Position-All
• 6.5 IterablePositionList-Header
• 6.5 PositionList-List
• 6.5 PositionList-Tail
• 6.6 DNode-DNode
• 6.9 NodePositionList-Header
• 6.9 NodePositionList-Listvars
• 6.9 NodePositionList-checkPosition
• 6.10 NodePositionList-first
• 6.11 NodePositionList-remove
• 6.12 PositionList-Header
• 6.12 IterablePositionList-Filler
• 6.12 PositionList-Iterator
• 6.12 PositionList-Tail
• 6.13 NodePositionList-toString
• 6.14 ForEach-Foreach
• 6.14 ForEach-array
• 6.14 ElementIterator-Iterator
• 6.15 NodePositionList-Iterator
• 6.16 PositionList-Header
• 6.16 IterablePositionList-Filler
• 6.16 PositionList-Positions
• 6.16 PositionList-Tail
• 6.17 NodePositionList-PIterator
• 6.18 Sequence-Sequence
• 6.19 FavoriteList-Favorites
• 6.20 FavoriteList-More
• 6.20 FavoriteList-Entry
• 6.21 FavoriteListMTF-Favorites
• 6.22 FavoriteTester-Tester
• A.3 PositionList-Header
• A.3 IterablePositionList-Filler
• A.3 PositionList-Iterator
• A.3 PositionList-Tail
• A.4 NodePositionList-toString
• A.5 ForEach-Foreach
• A.5 ForEach-array

Chapter 7: Trees

• 7.1 Tree-Tree
• 7.3 Trees-depth
• 7.5 Trees-height1
• 7.7 Trees-height2
• 7.9 Trees-preorderPrint
• 7.10 Trees-parentheticRepresentation
• 7.12 Trees-postorderPrint
• 7.13 Trees-diskSpace
• 7.14 BinaryTree-Tree
• 7.15 BTNode-BTNode
• 7.16 LinkedBinaryTree-LinkedBinaryTree
• 7.17 LinkedBinaryTree-LinkedBinaryTree2
• 7.18 LinkedBinaryTree-LinkedBinaryTree3
• 7.19 LinkedBinaryTree-LinkedBinaryTree4
• 7.20 LinkedBinaryTree-LinkedBinaryTree5
• 7.29 EulerTour-EulerTour
• 7.30 ExpressionTerm-ExpressionTerm
• 7.30 ExpressionVariable-ExpressionVariable
• 7.30 ExpressionOperator-ExpressionOperator
• 7.30 AdditionOperator-AdditionOperator
• 7.31 EvaluateExpressionTour-EvaluateExpressionTour
• 7.32 PrintExpressionTour-PrintExpressionTour

Chapter 8: Priority Queues

• 8.1 Entry-Entry
• 8.2 Lexicographic-Lexicographic
• 8.3 Point2D-Point2D
• 8.4 PriorityQueue-PriorityQueue
• 8.6 SortedListPriorityQueue-SortedListPriorityQueue1
• 8.7 DefaultComparator-DefaultComparator
• 8.8 SortedListPriorityQueue-SortedListPriorityQueue2
• 8.9 CompleteBinaryTree-HeapTree
• 8.10 ArrayListCompleteBinaryTree-VectorHeap
• 8.11 ArrayListCompleteBinaryTree-VectorHeap2
• 8.12 ArrayListCompleteBinaryTree-VectorHeap3
• 8.13 HeapPriorityQueue-HeapPriorityQueue
• 8.14 HeapPriorityQueue-mainMethods
• 8.15 HeapPriorityQueue-auxiliary
• 8.17 SortedListAdaptablePriorityQueue-SortedListAdaptablePriorityQueue
• 8.18 SortedListAdaptablePriorityQueue-LocationAwareEntry

Chapter 9: Maps and Dictionaries

• 9.2 HashCode-Long
• 9.2 HashCode-String
• 9.3 HashTableMap-Header
• 9.4 HashTableMap-Linear
• 9.5 HashTableMap-Linear2
• 9.6 WordCount-words

Chapter 10: Search Trees

• 10.3 BinarySearchTree-BinarySearchTree
• 10.4 BinarySearchTree-BinarySearchTree2
• 10.5 BinarySearchTree-BinarySearchTree3
• 10.7 AVLTree-AVLTree
• 10.8 AVLTree-AVLTree2
• 10.9 RBTree-RBTree
• 10.10 RBTree-insertItem
• 10.11 RBTree-remedyDoubleBlack

Chapter 11: Sorting, Sets, and Selection

• 11.3 Sort-mergeSort
• 11.3 Sort-merge
• 11.4 Sort-mergeSort2
• 11.7 Sort-quickSort
• 11.7 Sort-quickSortStep
• 11.9 Merge-Merger
• 11.10 UnionMerge-UnionMerger
• 11.10 IntersectMerge-IntersectMerger
• 11.10 SubtractMerge-SubtractMerger

Chapter 12: Text Processing

• 12.3 PatternMatching-BMmatch
• 12.6 PatternMatching-KMPmatch

Chapter 13: Graphs

• 13.2 DecorablePosition-Decorable
• 13.4 DFS-DFS
• 13.4 DFS-decorations
• 13.4 DFS-auxiliary
• 13.5 DFS-DFS2
• 13.5 DFS-Tail
• 13.6 ConnectivityDFS-ConnectivityTesterDFS
• 13.7 ComponentsDFS-CC
• 13.8 FindPathDFS-FindPathDFS
• 13.9 FindCycleDFS-FindCycleDFS
• 13.15 Dijkstra-execute
• 13.16 Dijkstra-dijkstraVisit

Chapter 14: Memory

• 14.1 StackExamples-factorial