.. 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 = "2019-02-05 11:59:57"; ODSA.SETTINGS.BUILD_CMAP = false;</script>


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


Mathematical Background
=======================

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

   MathpreIntro
   SetDef
   MiscMath
   Logarithms
   Summations
   RecurrenceIntro
   Proofs
   Estimation
   MathpreSumm

Big Ideas of Algorithms
=======================

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

   AnalChap
   AAOverview
   AnalPrelim
   AnalIntro
   ProblemSolving
   TOH

Time Complexity
===============

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

   AnalCases
   AnalCompvsAlg
   AnalAsymptotic
   AnalLower
   AnalProgram
   AnalProblem
   AnalMisunderstanding
   AnalMultiple
   AnalSpace
   AnalTuning
   AdvSumm
   Recurrence
   AlgAnalSummCS2
   AlgAnalSummCS3

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

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

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

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

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

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

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

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

   BalancedTree
   AVL
   Splay
   RedBlack

Sorting
=======

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

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

Graphs
======

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

   GraphIntro
   GraphImpl
   GraphTraversal
   GraphTopsort
   GraphShortest
   MCST
   UnionFind
   Kruskal
   Floyd

Dynamic Programming
===================

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

   DynamicProgramming
   Knapsack
   EditDistance

Limits to Computing
===================

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

   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

Appendix
========

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

   Glossary
   Bibliography


.. toctree::
   :maxdepth: 3


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