.. This file is part of the OpenDSA eTextbook project. See .. http://opendsa.org for more details. .. Copyright (c) 2011-2023 by the OpenDSA Project Contributors, and .. distributed under an MIT open source license. .. OpenDSA documentation master file, created by sphinx-quickstart on Sat Mar 17 18:07:39 2012. You can adapt this file completely to your liking, but it should at least contain the root `toctree` directive. .. avmetadata:: OpenDSA Sample eTextbook :author: OpenDSA Contributors :topic: Data Structures .. chapnum:: :start: 0 :prefix: Chapter .. _index: .. raw:: html .. |--| unicode:: U+2013 .. en dash .. |---| unicode:: U+2014 .. em dash, trimming surrounding whitespace :trim: modules ======= .. toctree:: :numbered: :maxdepth: 3 IntroDSA CarlGauss FrancisBacon cmdline parameters eclipseparameters webcattools debugmethods debug scanning randomaccessfile junitstart junitbasic junitcoverage ADT IntroOO IntroUML IntroProcess PointerIntro BasicPointers1 BasicPointers2 Syntax LocalMem HeapMem Links1 Links2 Exercises MathpreIntro SetDef MiscMath Logarithms Summations RecurrenceIntro Proofs Estimation MathpreSumm BinarySearch AnalChap AnalPrelim AnalIntro AnalCases AnalCompvsAlg AnalAsymptotic AnalLower AnalProgram AnalProblem AnalMisunderstanding AnalMultiple AnalSpace AnalTuning AlgAnalSummCS2 AlgAnalSummCS3 ListIntro ListADT ListArray ListLinked ListAnalysis ListDouble ListElement StackArray StackLinked Freelist StackRecur Queue QueueLinked ListSumm RecIntro Write CodeCompletionEx HarderWrite HarderCodeCompletionEx WritingEx Trace TracingEx RecSummaryEx DesignPatterns DesignAltList Comparison Dictionary BinaryTreeIntro BinaryTree RecursiveDS BinaryTreeFullThm BinaryTreeTraversal WritingTraversals BinaryTreeInfFlw BinaryTreeImpl Composite BinaryTreeNodeSpace BST BSTDict BinaryTreeGuidedInfFlw MultipleBinaryTrees BSTCheck CompleteTree Heaps Huffman TreeTrie HuffProof BinaryChapSumm InSort SortNotation InsertionSort BubbleSort SelectionSort ExchangeSort SortOpt Shellsort Mergesort MergesortImpl Quicksort Heapsort BinSort RadixSort SortingEmpirical SortingLowerBound SortSumm FileProc Secondary Diskdrive BuffPool FileProg ExternalSort HashIntro HashFunc HashFuncExamp OpenHash BucketHash HashCSimple HashCImproved HashAnal HashDel HashSumm MemmanIntro Dynamic SequentialFit FirstFit CircularFit BestFit WorstFit MMPerformance Buddy Garbage IndexIntro LinearIndexing ISAM TreeIndexing TwoThreeTree BTree IndexingSumm GenTreeIntro UnionFind SequentialRep GraphIntro GraphImpl GraphTraversal GraphTopsort GraphShortest MCST Kruskal Floyd Spatial PRquadtree KDtree Bintree OtherSpatial AAIntro ProblemSolving AAOverview TOH BoundsReview GrowthRate AdvSumm Recurrence SearchIntro UnsortedSearch SortedSearch SelfOrg SetSearch PerfectHash BoundMax BoundAdversary BoundState BoundiBest SortingOptimal Numeric Transform FFT Probabilistic Primes RandomNums SkipList BalancedTree AVL Splay RedBlack Sparse DynamicProgramming AmortAnal Knapsack EditDistance StringSearchKMP StringSearchBoyerMoore StringSearchRabinKarp GenTreeImplement Kary LimComp Reduction NPComplete circuitSAT SAT threeSAT clique independentSet vertexCover hamiltonianCycle TSP provingNPC circuitSAT_to_SAT SAT_to_threeSAT threeSAT_to_clique clique_to_independentSet independentSet_to_vertexCover threeSAT_to_hamiltonianCycle hamiltonianCycle_to_TSP NPCoping Impossible Turing Grammars1 Grammars2 Grammars3 Grammars4 Grammars5 FP1 FP2 FP3 FP4 FP5 FP6 FP7 FP8 FP9 Syntax Semantics FreeBoundVariables AlphaConversion Substitution BetaReduction ReductionStrategies ChurchNumerals RecursiveFunctions SLang1 Environment SLang1withLetExpressions SLang2 SLang2TTK SLang2ParameterPassing LazyLists TypeSystems TypeInference PL_Glossary FLIntro FLOverview FLConcepts DFA NFA Minimization RegEx RegGrammar RegClosure NonRegular DFAproperties CFL CFLSimp PDA PDACFL DPDA CFLProp TuringIntro Turing ParseIntro LLParsing LRParsing CYKParsing Compiler RecEnum IntroEx FAEx RegLangEx Sheet5 Sheet6 Sheet7 IntroExMore FAExMore RegLangExMore Sheet5Practice Iteration IterationAV IterationEX1 IterationEX2 CoursePolicies GettingStarted InheritanceAndPolymorphism ConditionalActions SoftwareTesting VariablesFieldsAndParameters PicturesAndForEachLoops AggregationStringsandMoreLoops GroupingObjectsUsingListsAndNestedForLoops ListAndLoopsDeepDive Arrays MultiDimensionalArrays FileIO MapsAndSets StaticMainAndExceptions .. toctree:: :maxdepth: 3 ToDo * :ref:`genindex` * :ref:`search`