.. 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-10-05 11:59:01"; ODSA.SETTINGS.BUILD_CMAP = true;</script>


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


Preface
=======

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

   Intro

Week 1: Introduction and Object Oriented Programming
====================================================

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

   IntroOO
   ADT
   IntroDSA

Week 2: File I/O
================

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

   FileProc
   Secondary
   Diskdrive
   FileProg

Week 3: Recursion
=================

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

   RecIntro
   Write
   CodeCompletionEx
   HarderWrite
   HarderCodeCompletionEx
   WritingEx
   Trace
   TracingEx
   RecSummaryEx

Week 4: Binary Trees
====================

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

   BinaryTreeIntro
   BinaryTree
   BinaryTreeTraversal
   BST

Week 6: Heaps
=============

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

   CompleteTree
   Heaps

Week 7: Balanced Trees
======================

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

   BalancedTree
   AVL
   RedBlack
   SkipList

Week 8: B-Trees and Graph Representations
=========================================

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

   IndexIntro
   TreeIndexing
   TwoThreeTree
   BTree
   BTreeNewTest
   IndexingSumm
   BTreeTest
   GraphIntro
   GraphCM
   GraphImpl

Week 9: Graph Algorithms
========================

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

   GraphTraversal
   GraphTopsort
   GraphShortest
   Floyd
   MCST
   Kruskal

Week 10: Advanced Sorting Algorithms
====================================

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

   InSort
   SortNotation
   Shellsort
   Heapsort
   Mergesort
   Quicksort
   BinSort
   RadixSort
   SortingEmpirical

Week 11: Hashing
================

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

   HashIntro
   HashFunc
   HashFuncExamp
   OpenHash
   BucketHash
   HashCSimple


.. toctree::
   :maxdepth: 3


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