.. 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

   <script>ODSA.SETTINGS.DISP_MOD_COMP = false;ODSA.SETTINGS.MODULE_NAME = "index";ODSA.SETTINGS.MODULE_LONG_NAME = "Contents";ODSA.SETTINGS.MODULE_CHAPTER = ""; ODSA.SETTINGS.BUILD_DATE = "2018-07-18 16:20:01"; ODSA.SETTINGS.BUILD_CMAP = false;</script>


.. |--| unicode:: U+2013   .. en dash
.. |---| unicode:: U+2014  .. em dash, trimming surrounding whitespace
   :trim:


Introduction to Pointers in Java
================================

.. toctree::
   :numbered:
   :maxdepth: 3

   PointerIntro
   BasicPointers
   LocalMem
   HeapMem
   Links

Linear Structures
=================

.. toctree::
   :numbered:
   :maxdepth: 3

   ListIntro
   ListADT
   ListArray
   ListLinked
   ListAnalysis
   ListDouble
   ListElement
   StackArray
   StackLinked
   Freelist
   StackRecur
   Queue
   QueueLinked
   ListSumm

Recursion
=========

.. toctree::
   :numbered:
   :maxdepth: 3

   RecIntro
   Write
   CodeCompletionEx
   HarderWrite
   HarderCodeCompletionEx
   WritingEx
   Trace
   TracingEx
   RecSummaryEx

Algorithm Analysis
==================

.. toctree::
   :numbered:
   :maxdepth: 3

   AnalChap
   AnalPrelim
   AnalIntro
   AnalCases
   AnalCompvsAlg
   AnalAsymptotic
   AnalLower
   AnalProgram
   AnalProblem
   AnalMisunderstanding
   AnalMultiple
   AnalSpace
   AnalTuning
   AlgAnalSummCS2
   AlgAnalSummCS3

Searching
=========

.. toctree::
   :numbered:
   :maxdepth: 3

   SearchIntro
   UnsortedSearch
   SortedSearch
   SelfOrg
   SetSearch
   PerfectHash

Sorting
=======

.. toctree::
   :numbered:
   :maxdepth: 3

   InSort
   SortNotation
   InsertionSort
   BubbleSort
   SelectionSort
   ExchangeSort
   SortOpt
   Shellsort
   Mergesort
   MergesortImpl
   Quicksort
   Heapsort
   BinSort
   RadixSort
   SortingEmpirical
   SortingLowerBound
   SortSumm

Binary Trees
============

.. toctree::
   :numbered:
   :maxdepth: 3

   BinaryTreeIntro
   BinaryTree
   RecursiveDS
   BinaryTreeFullThm
   BinaryTreeTraversal
   WritingTraversals
   BinaryTreeInfFlw
   BinaryTreeImpl
   Composite
   BinaryTreeNodeSpace
   BST
   BSTDict
   BinaryTreeGuidedInfFlw
   MultipleBinaryTrees
   BSTCheck
   CompleteTree
   Heaps
   Huffman
   TreeTrie
   HuffProof
   BinaryChapSumm

Search Structures
=================

.. toctree::
   :numbered:
   :maxdepth: 3

   BalancedTree
   AVL
   Splay
   RedBlack

Hashing
=======

.. toctree::
   :numbered:
   :maxdepth: 3

   HashIntro
   HashFunc
   HashFuncExamp
   OpenHash
   BucketHash
   HashCSimple
   HashCImproved
   HashAnal
   HashDel
   HashSumm

Graphs
======

.. toctree::
   :numbered:
   :maxdepth: 3

   GraphIntro
   GraphImpl
   GraphTraversal
   GraphTopsort
   GraphShortest
   MCST
   Kruskal
   Floyd

Miscellaneous
=============

.. toctree::
   :numbered:
   :maxdepth: 3

   DynamicProgramming
   AmortAnal
   Knapsack
   EditDistance
   StringSearchKMP
   StringSearchBoyerMoore
   StringSearchRabinKarp
   GenTreeImplement
   Kary


.. toctree::
   :maxdepth: 3


* :ref:`genindex`
* :ref:`search`