.. 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 = "2017-10-09 00:04:22"; ODSA.SETTINGS.BUILD_CMAP = false;</script>


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


Preface
=======

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

   Intro

Introduction
============

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

   AAIntro
   ProblemSolving
   AAOverview

Analyzing Problems: The Basics
==============================

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

   TOH
   BoundsReview
   GrowthRate
   Summations
   AdvSumm
   RecurrenceIntro
   Recurrence
   Proofs

Searching
=========

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

   SearchIntro
   UnsortedSearch
   SortedSearch

Lower Bounds
============

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

   SortingLowerBound
   BoundMax
   SetDef
   BoundAdversary
   BoundState
   BoundiBest

Number Problems
===============

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

   Numeric
   FFT

Probabilistic Algorithms
========================

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

   Probabilistic
   Primes
   RandomNums
   SkipList

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

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

   DynamicProgramming
   Floyd
   AmortAnal
   SortingOptimal

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

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

   LimComp
   Reduction
   NPComplete
   provingNPC
   circuitSAT
   SAT
   threeSAT
   clique
   independentSet
   vertexCover
   hamiltonianCycle
   TSP
   circuitSAT_to_SAT
   SAT_to_threeSAT
   threeSAT_to_clique
   independentSet_to_vertexCover
   threeSAT_to_hamiltonianCycle
   NPCoping
   Impossible
   Turing

Appendix
========

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

   Glossary
   Bibliography


.. toctree::
   :maxdepth: 3


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