Code Fragments

Chapter 3: Search Trees and Skip Lists

• 3.52 Item-Item
• 3.53 BinarySearchTree-BinarySearchTree
• 3.54 BinarySearchTree-BinarySearchTree2
• 3.55 BinarySearchTree-BinarySearchTree3
• 3.56 AVLItem-AVLItem
• 3.57 AVLTree-AVLTree
• 3.58 AVLTree-AVLTree2
• 3.59 RBTItem-RBTItem
• 3.60 RBTree-RBTree
• 3.61 RBTree-insertItem
• 3.62 RBTree-remedyDoubleBlack

Chapter 4: Sorting, Sets, and Selection

• 4.18 Sort-quickSort
• 4.19 Sort-quickSortStep

Chapter 6: Graphs

• 6.21 DFS-DFS
• 6.22 DFS-auxiliary
• 6.23 DFS-decorations
• 6.24 ConnectivityTesterDFS-ConnectivityTesterDFS
• 6.25 FindPathDFS-FindPathDFS
• 6.26 FindCycleDFS-FindCycleDFS

Chapter 7: Weighted Graphs

• 7.22 Dijkstra-execute
• 7.23 Dijkstra-dijkstraVisit
• 7.24 Dijkstra-auxiliary
• 7.25 MyDijkstra-MyDijkstra

Chapter 8: Network Flow and Matching

• 8.16 MinCostFlowTemplate-InstanceVariables
• 8.17 MinCostFlowTemplate-AbstractMethods
• 8.18 MinCostFlowTemplate-doOneIteration
• 8.19 MinCostFlowTemplate-CoreAlgorithm
• 8.20 MinCostFlowTemplate-Init
• 8.21 MinCostFlowTemplate-HelperMethods
• 8.22 MinCostFlowTemplate-OutputMethods

Chapter 10: Number Theory and Cryptography

• 10.16 BigInt-BigInt
• 10.17 BigInt-multiply
• 10.18 BigInt-FFT
• 10.20 BigInt-support
• 10.21 FastInt-multiply
• 10.22 FastInt-FFT
• 10.23 FastInt-support1

Chapter 12: Computational Geometry

• 12.26 ConvexHull-ConvexHull
• 12.27 ConvexHull-ConvexHull2
• 12.28 ConvexHull-ConvexHull3

Chapter 13: NP-Completeness

• 13.18 Subset-Subset
• 13.20 Knapsack-Knapsack
• 13.21 Configuration-Configuration
• 13.22 Configuration-Support