.. This file is part of the OpenDSA eTextbook project. See .. http://algoviz.org/OpenDSA for more details. .. Copyright (c) 2012-2016 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: Preface ======= .. toctree:: :numbered: :maxdepth: 3 Intro Tutorials ========= .. toctree:: :numbered: :maxdepth: 3 scanning randomaccessfile cmdline parameters debugmethods debug eclipseparameters junitbasic junitstart junitcoverage TestIntro TestCoverage Example2 Bowling Pointers and References ======================= .. toctree:: :numbered: :maxdepth: 3 PointerIntro BasicPointers1 BasicPointers2 Syntax LocalMem HeapMem PointersCM PointerExercises Object Oriented Programming =========================== .. toctree:: :numbered: :maxdepth: 3 ADT IntroOO IntroUML Linear Structures 1 =================== .. toctree:: :numbered: :maxdepth: 3 ListIntro ListADT ListArray ListLinked Links1 Links2 Exercises ListAnalysis Algorithm Analysis ================== .. toctree:: :numbered: :maxdepth: 3 AnalChap AnalPrelim AnalIntro AnalCases AnalCompvsAlg AnalAsymptotic AnalLower AnalProgram AnalProblem AnalMisunderstanding AnalMultiple AmortAnal AnalTuning AlgAnalSummCS2 Recursion ========= .. toctree:: :numbered: :maxdepth: 3 RecIntro Write CodeCompletionEx HarderWrite HarderCodeCompletionEx WritingEx Trace TracingEx RecSummaryEx Searching ========= .. toctree:: :numbered: :maxdepth: 3 SearchIntro BinarySearch SortedSearch UnsortedSearch Sorting ======= .. toctree:: :numbered: :maxdepth: 3 InSort SortNotation InsertionSort BubbleSort SelectionSort ExchangeSort SortOpt Mergesort MergesortImpl Quicksort Heapsort Shellsort BinSort RadixSort SortingEmpirical SortingLowerBound SortSumm Linear Structures 2 =================== .. toctree:: :numbered: :maxdepth: 3 StackArray StackLinked Queue QueueLinked ListDouble SkipList ListSumm General Trees ============= .. toctree:: :numbered: :maxdepth: 3 GenTreeIntro Binary Trees 1 ============== .. toctree:: :numbered: :maxdepth: 3 BinaryTreeIntro BinaryTree RecursiveDS BinaryTreeTraversal WritingTraversals BinaryTreeInfFlw BinaryTreeImpl BST BinaryTreeGuidedInfFlw MultipleBinaryTrees BinaryChapSumm Binary Trees 2 ============== .. toctree:: :numbered: :maxdepth: 3 BinaryTreeFullThm CompleteTree Heaps BalancedTree AVL RedBlack Splay Huffman Hashing ======= .. toctree:: :numbered: :maxdepth: 3 HashIntro HashFunc HashFuncExamp OpenHash BucketHash HashCSimple HashCImproved HashAnal HashDel HashSumm Appendix ======== .. toctree:: :numbered: :maxdepth: 3 Glossary Bibliography .. toctree:: :maxdepth: 3 * :ref:`genindex` * :ref:`search`