.. 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-06-19 15:06:16"; 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

   IntroDSA
   ADT

Programming Tutorials
=====================

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

   cmdline
   parameters
   debugmethods
   scanning
   junitstart
   junitbasic

Object-Oriented Programming
===========================

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

   IntroOO

List Interface & Array-based Lists
==================================

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

   ListADT
   ListArray

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

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

   AnalPrelim
   AnalIntro
   AnalCases

Stacks
======

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

   StackArray
   StackLinked

Recursion
=========

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

   RecIntro
   Write
   CodeCompletionEx
   HarderWrite
   HarderCodeCompletionEx
   WritingEx
   Trace
   TracingEx
   RecSummaryEx

Queues
======

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

   Queue
   QueueLinked

Linked Lists
============

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

   ListLinked
   ListAnalysis
   ListDouble
   ListElement

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

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

   BinaryTreeIntro
   BinaryTree
   RecursiveDS
   BinaryTreeFullThm
   BinaryTreeTraversal
   WritingTraversals
   BinaryTreeInfFlw
   CompleteTree
   Heaps

Sorting
=======

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

   InSort
   SortNotation
   Comparison
   InsertionSort
   BubbleSort
   SelectionSort
   Shellsort
   Mergesort
   Quicksort
   Heapsort

Hashing
=======

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

   HashIntro
   HashFunc
   HashFuncExamp
   OpenHash
   BucketHash
   HashCSimple
   HashCImproved

Graphs
======

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

   GraphIntro
   GraphImpl
   GraphTraversal
   GraphTopsort
   GraphShortest

Appendix
========

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

   Glossary
   Bibliography


.. toctree::
   :maxdepth: 3

   Gradebook
   RegisterBook

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