programindex.htm

datastucutre and algorithms, application, in C

<A href="arrayQueue.h">Program 9.2
arrayQueue.h</A>
<br>
<A href="arrayQueue.h">Program 9.3
arrayQueue.h</A>
<br>
<A href="arrayQueue.h">Program 9.4
arrayQueue.h</A>
<br>
<A href="linkedQueue.h">Program 9.5
linkedQueue.h</A>
<br>
<A href="railroadWithQueues.cpp">Program 9.6
railroadWithQueues.cpp</A>
<br>
<A href="railroadWithQueues.cpp">Program 9.7
railroadWithQueues.cpp</A>
<br>
<A href="wireRouter.cpp">Program 9.8
wireRouter.cpp</A>
<br>
<A href="componentLabeling.cpp">Program 9.9
componentLabeling.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.10
machineShopSimulatorcpph</A>
<br>
<A href="task.h">Program 9.11
task.h</A>
<br>
<A href="job.h">Program 9.12
job.h</A>
<br>
<A href="machine.h">Program 9.13
machine.h</A>
<br>
<A href="eventList.h">Program 9.14
eventList.h</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.15
machineShopSimulator.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.16
machineShopSimulator.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.17
machineShopSimulator.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.18
machineShopSimulator.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.19
machineShopSimulator.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.20
machineShopSimulator.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.21
machineShopSimulator.cpp</A>
<br>
<br><br>
<a name = "Chapter 10"></a>
<h3>Chapter 10 Programs</h3>
<A href="dictionary.h">Program 10.1
dictionary.h</A>
<br>
<A href="sortedChain.h">Program 10.2
sortedChain.h</A>
<br>
<A href="sortedChain.h">Program 10.3
sortedChain.h</A>
<br>
<A href="sortedChain.h">Program 10.4
sortedChain.h</A>
<br>
<A href="skipNode.h">Program 10.5
skipNode.h</A>
<br>
<A href="skipList.h">Program 10.6
skipList.h</A>
<br>
<A href="skipList.h">Program 10.7
skipList.h</A>
<br>
<A href="skipList.h">Program 10.8
skipList.h</A>
<br>
<A href="skipList.h">Program 10.9
skipList.h</A>
<br>
<A href="skipList.h">Program 10.10
skipList.h</A>
<br>
<A href="skipList.h">Program 10.11
skipList.h</A>
<br>
<A href="skipList.h">Program 10.12
skipList.h</A>
<br>
<A href="threeToLong.cpp">Program 10.13
threeToLong.cpp</A>
<br>
<A href="stringToInt.cpp">Program 10.14
stringToInt.cpp</A>
<br>
<A href="hash.h">Program 10.15
hash.h</A>
<br>
<A href="hashTable.h">Program 10.16
hashTable.h</A>
<br>
<A href="hashTable.h">Program 10.17
hashTable.h</A>
<br>
<A href="hashTable.h">Program 10.18
hashTable.h</A>
<br>
<A href="hashTable.h">Program 10.19
hashTable.h</A>
<br>
<A href="hashChains.h">Program 10.20
hashChains.h</A>
<br>
<A href="compress.cpp">Program 10.21
compress.cpp</A>
<br>
<A href="compress.cpp">Program 10.22
compress.cpp</A>
<br>
<A href="compress.cpp">Program 10.23
compress.cpp</A>
<br>
<A href="compress.cpp">Program 10.24
compress.cpp</A>
<br>
<A href="decompress.cpp">Program 10.25
decompress.cpp</A>
<br>
<A href="decompress.cpp">Program 10.26
decompress.cpp</A>
<br>
<A href="decompress.cpp">Program 10.27
decompress.cpp</A>
<br>
<A href="decompress.cpp">Program 10.28
decompress.cpp</A>
<br>
<br><br>
<a name = "Chapter 11"></a>
<h3>Chapter 11 Programs</h3>
<A href="binaryTreeNode.h">Program 11.1
binaryTreeNode.h</A>
<br>
<A href="binaryTreeTraversals.cpp">Program 11.2
binaryTreeTraversals.cpp</A>
<br>
<A href="binaryTreeTraversals.cpp">Program 11.3
binaryTreeTraversals.cpp</A>
<br>
<A href="binaryTreeTraversals.cpp">Program 11.4
binaryTreeTraversals.cpp</A>
<br>
<A href="binaryTreeTraversals.cpp">Program 11.5
binaryTreeTraversals.cpp</A>
<br>
<A href="infix.cpp">Program 11.6
infix.cpp</A>
<br>
<A href="binaryTreeTraversals.cpp">Program 11.7
binaryTreeTraversals.cpp</A>
<br>
<A href="binaryTree.h">Program 11.8
binaryTree.h</A>
<br>
<A href="linkedBinaryTree.h">Program 11.9
linkedBinaryTree.h</A>
<br>
<A href="linkedBinaryTree.h">Program 11.10
linkedBinaryTree.h</A>
<br>
<A href="linkedBinaryTree.h">Program 11.11
linkedBinaryTree.h</A>
<br>
<A href="booster.h">Program 11.12
booster.h</A>
<br>
<A href="booster.cpp">Program 11.13
booster.cpp</A>
<br>
<A href="unionFindWithTrees.cpp">Program 11.14
unionFindWithTrees.cpp</A>
<br>
<A href="unionFindNode.h">Program 11.15
unionFindNode.h</A>
<br>
<A href="unionFindWithWeightingRule.cpp">Program 11.16
unionFindWithWeightingRule.cpp</A>
<br>
<A href="unionFindWithCompaction.cpp">Program 11.17
unionFindWithCompaction.cpp, fastUnionFind.h</A>
<br>
<br><br>
<a name = "Chapter 12"></a>
<h3>Chapter 12 Programs</h3>
<A href="maxPriorityQueue.h">Program 12.1
maxPriorityQueue.h</A>
<br>
<A href="maxHeap.h">Program 12.2
maxHeap.h</A>
<br>
<A href="maxHeap.h">Program 12.3
maxHeap.h</A>
<br>
<A href="maxHeap.h">Program 12.4
maxHeap.h</A>
<br>
<A href="maxHblt.h">Program 12.5
maxHblt.h</A>
<br>
<A href="maxHblt.h">Program 12.6
maxHblt.h</A>
<br>
<A href="maxHblt.h">Program 12.7
maxHblt.h</A>
<br>
<A href="heapSort.h">Program 12.8
heapSort.h</A>
<br>
<A href="lptSchedule.cpp">Program 12.9
lptSchedule.cpp</A>
<br>
<A href="huffmanTree.cpp">Program 12.10
huffmanTree.cpp</A>
<br>
<br><br>
<a name = "Chapter 13"></a>
<h3>Chapter 13 Programs</h3>
<A href="winnerTree.h">Program 13.1
winnerTree.h</A>
<br>
<A href="firstFit.cpp">Program 13.2
firstFit.cpp</A>
<br>
<br><br>
<a name = "Chapter 14"></a>
<h3>Chapter 14 Programs</h3>
<A href="bsTree.h">Program 14.1
bsTree.h</A>
<br>
<A href="indexedBSTree.h">Program 14.2
indexedBSTree.h</A>
<br>
<A href="binarySearchTree.h">Program 14.3
binarySearchTree.h</A>
<br>
<A href="binarySearchTree.h">Program 14.4
binarySearchTree.h</A>
<br>
<A href="binarySearchTree.h">Program 14.5
binarySearchTree.h</A>
<br>
<A href="binarySearchTree.h">Program 14.6
binarySearchTree.h</A>
<br>
<A href="dBinarySearchTree.h">Program 14.7
dBinarySearchTree.h</A>
<br>
<A href="histogram.cpp">Program 14.8
histogram.cpp</A>
<br>
<A href="treeHistogram.cpp">Program 14.9
treeHistogram.cpp</A>
<br>
<A href="dBinarySearchTreeWithGE.h">Program 14.10
dBinarySearchTreeWithGE.h</A>
<br>
<A href="bestFit.cpp">Program 14.11
bestFit.cpp</A>
<br>
<A href="crossings.cpp">Program 14.12
crossings.cpp</A>
<br>
<br><br>
<a name = "Chapter 15"></a>
<h3>Chapter 15 Programs</h3>
Chapter 15 has no programs.
<br>
<br><br>
<a name = "Chapter 16"></a>
<h3>Chapter 16 Programs</h3>
<A href="graph.h">Program 16.1
graph.h</A>
<br>
<A href="adjacencyWDigraph.h">Program 16.2
adjacencyWDigraph.h</A>
<br>
<A href="linkedDigraph.h">Program 16.3
linkedDigraph.h</A>
<br>
<A href="graph.h">Program 16.4
graph.h</A>
<br>
<A href="adjacencyWDigraph.h">Program 16.5
adjacencyWDigraph.h</A>
<br>
<A href="linkedDigraph.h">Program 16.6
linkedDigraph.h</A>
<br>
<A href="graph.h">Program 16.7
graph.h</A>
<br>
<A href="graph.h">Program 16.8
graph.h</A>
<br>
<A href="graph.h">Program 16.9
graph.h</A>
<br>
<A href="graph.h">Program 16.10
graph.h</A>
<br>
<A href="graph.h">Program 16.11
graph.h</A>
<br>
<br><br>
<a name = "Chapter 17"></a>
<h3>Chapter 17 Programs</h3>
<A href="greedyLoading.h">Program 17.1
greedyLoading.h</A>
<br>
<A href="graph.h">Program 17.2
graph.h</A>
<br>
<A href="adjacencyWDigraph.h">Program 17.3
adjacencyWDigraph.h</A>
<br>
<A href="graph.h">Program 17.4
graph.h</A>
<br>
<br><br>
<a name = "Chapter 18"></a>
<h3>Chapter 18 Programs</h3>
<A href="minMax3.cpp">Program 18.1
minMax3.cpp</A>
<br>
<A href="tileBoard.cpp">Program 18.2
tileBoard.cpp</A>
<br>
<A href="mergeSort.h">Program 18.3
mergeSort.h</A>
<br>
<A href="mergeSort.h">Program 18.4
mergeSort.h</A>
<br>
<A href="mergeSort.h">Program 18.5
mergeSort.h</A>
<br>
<A href="quickSort.h">Program 18.6
quickSort.h</A>
<br>
<A href="quickSort.h">Program 18.7
quickSort.h</A>
<br>
<A href="select.cpp">Program 18.8
select.cpp</A>
<br>
<A href="select.cpp">Program 18.9
select.cpp</A>
<br>
<A href="closestPoints.cpp">Program 18.10
closestPoints.cpp</A>
<br>
<A href="closestPoints.cpp">Program 18.11
closestPoints.cpp</A>
<br>
<A href="closestPoints.cpp">Program 18.12
closestPoints.cpp</A>
<br>
<br><br>
<a name = "Chapter 19"></a>
<h3>Chapter 19 Programs</h3>
<A href="recursiveDPKnapsack.cpp">Program 19.1
recursiveDPKnapsack.cpp</A>
<br>
<A href="noRecomputationDPKnapsack.cpp">Program 19.2
noRecomputationDPKnapsack.cpp</A>
<br>
<A href="iterativeDPKnapsack.cpp">Program 19.3
iterativeDPKnapsack.cpp</A>
<br>
<A href="iterativeDPKnapsack.cpp">Program 19.4
iterativeDPKnapsack.cpp</A>
<br>
<A href="recursiveDPMatrixChain.cpp">Program 19.5
recursiveDPMatrixChain.cpp</A>
<br>
<A href="noRecomputationDPMatrixChain.cpp">Program 19.6
noRecomputationDPMatrixChain.cpp</A>
<br>
<A href="iterativeDPMatrixChain.cpp">Program 19.7
iterativeDPMatrixChain.cpp</A>
<br>
<A href="adjacencyWDigraph.cpp">Program 19.8
adjacencyWDigraph.cpp</A>
<br>
<A href="adjacencyWDigraph.cpp">Program 19.9
adjacencyWDigraph.cpp</A>
<br>
<A href="graph.cpp">Program 19.10
graph.cpp</A>
<br>
<A href="noncrossingSubset.cpp">Program 19.11
noncrossingSubset.cpp</A>
<br>
<A href="noncrossingSubset.cpp">Program 19.12
noncrossingSubset.cpp</A>
<br>
<br><br>
<a name = "Chapter 20"></a>
<h3>Chapter 20 Programs</h3>
<A href="recursiveBTLoading1.cpp">Program 20.1
recursiveBTLoading1.cpp</A>
<br>
<A href="recursiveBTLoading2.cpp">Program 20.2
recursiveBTLoading2.cpp</A>
<br>
<A href="recursiveBTLoading3.cpp">Program 20.3
recursiveBTLoading3.cpp</A>
<br>
<A href="recursiveBTLoading3.cpp">Program 20.4
recursiveBTLoading3.cpp</A>
<br>
<A href="iterativeBTLoading.cpp">Program 20.5
iterativeBTLoading.cpp</A>
<br>
<A href="recursiveBTKnapsack.cpp">Program 20.6
recursiveBTKnapsack.cpp</A>
<br>
<A href="recursiveBTKnapsack.cpp">Program 20.7
recursiveBTKnapsack.cpp</A>
<br>
<A href="recursiveBTKnapsack.cpp">Program 20.8
recursiveBTKnapsack.cpp</A>
<br>
<A href="recursiveBTKnapsack.cpp">Program 20.9
recursiveBTKnapsack.cpp</A>
<br>
<A href="adjacencyGraph.h">Program 20.10
adjacencyGraph.h</A>
<br>
<A href="adjacencyGraph.h">Program 20.11
adjacencyGraph.h</A>
<br>
<A href="adjacencyWDigraph.h">Program 20.12
adjacencyWDigraph.h</A>
<br>
<A href="adjacencyWDigraph.h">Program 20.13
adjacencyWDigraph.h</A>
<br>
<A href="recursiveBTBoard.cpp">Program 20.14
recursiveBTBoard.cpp</A>
<br>
<A href="recursiveBTBoard.cpp">Program 20.15
recursiveBTBoard.cpp</A>
<br>
<br><br>
<a name = "Chapter 21"></a>
<h3>Chapter 21 Programs</h3>
<A href="fifoBBLoading1.cpp">Program 21.1
fifoBBLoading1.cpp</A>
<br>
<A href="fifoBBLoading2.cpp">Program 21.2
fifoBBLoading2.cpp</A>
<br>
<A href="fifoBBLoading3.cpp">Program 21.3
fifoBBLoading3.cpp</A>
<br>
<A href="maxProfitBBLoading.cpp">Program 21.4
maxProfitBBLoading.cpp</A>
<br>
<A href="maxProfitBBLoading.cpp">Program 21.5
maxProfitBBLoading.cpp</A>
<br>
<A href="maxProfitBBKnapsack.cpp">Program 21.6
maxProfitBBKnapsack.cpp</A>
<br>
<A href="adjacencyGraph.h">Program 21.7
adjacencyGraph.h</A>
<br>
<A href="adjacencyWDigraph.h">Program 21.8
adjacencyWDigraph.h</A>
<br>
<A href="leastCostBBBoard.cpp">Program 21.9
leastCostBBBoard.cpp</A>
<br>


</FONT>
</BODY>
</HTML>