.. 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 .. |--| unicode:: U+2013 .. en dash .. |---| unicode:: U+2014 .. em dash, trimming surrounding whitespace :trim: Preface ======= .. toctree:: :numbered: :maxdepth: 3 Intro Introduction for Data Structures and Algorithms Courses ======================================================= .. toctree:: :numbered: :maxdepth: 3 IntroDSA ADT Week 1 ====== .. toctree:: :numbered: :maxdepth: 3 MemmanIntro Dynamic BestFit FirstFit PointerIntro BasicPointers LocalMem HeapMem RefParam Exercises Week 2: Asymptotic analysis =========================== .. toctree:: :numbered: :maxdepth: 3 AlgAnalSummCS3 AnalProblem AnalChap AnalTuning AnalMisunderstanding AnalLower AnalMultiple AnalSpace Week 2: Algorithm Analysis ========================== .. toctree:: :numbered: :maxdepth: 3 AnalPrelim AnalIntro AnalCases AnalCompvsAlg AnalAsymptotic AnalProgram AlgAnalSummCS2 Week 3: Linked Lists ==================== .. toctree:: :numbered: :maxdepth: 3 ListLinked ListAnalysis ListDouble ListElement Freelist ListSumm Week 4: Binary Trees ==================== .. toctree:: :numbered: :maxdepth: 3 BinaryTreeIntro BinaryTree RecursiveDS BinaryTreeFullThm BinaryTreeTraversal WritingTraversals BinaryTreeInfFlw BinaryTreeImpl Composite BinaryTreeNodeSpace BSTDict BinaryTreeGuidedInfFlw MultipleBinaryTrees BSTCheck CompleteTree Huffman TreeTrie HuffProof BinaryChapSumm Week 4: Stacks ============== .. toctree:: :numbered: :maxdepth: 3 StackArray StackLinked Week 4: Queues ============== .. toctree:: :numbered: :maxdepth: 3 Queue QueueLinked Week 5: BST & Splay Trees ========================= .. toctree:: :numbered: :maxdepth: 3 BST Splay BalancedTree Week 6: Priority Queues and Heaps ================================= .. toctree:: :numbered: :maxdepth: 3 Heaps Week 7: Leftist Heaps and Red-Black Trees ========================================= .. toctree:: :numbered: :maxdepth: 3 RedBlack Week 8: Hashing =============== .. toctree:: :numbered: :maxdepth: 3 HashIntro HashFunc HashFuncExamp OpenHash BucketHash HashCSimple HashCImproved HashAnal HashDel HashSumm Week 9: Graphs ============== .. toctree:: :numbered: :maxdepth: 3 GraphIntro Floyd GraphImpl GraphTraversal MCST GraphShortest GraphTopsort Week 9: Skip Lists ================== .. toctree:: :numbered: :maxdepth: 3 SkipList Week 10: Search =============== .. toctree:: :numbered: :maxdepth: 3 UnsortedSearch Kruskal Appendix: Recursion =================== .. toctree:: :numbered: :maxdepth: 3 RecIntro Write CodeCompletionEx HarderWrite HarderCodeCompletionEx WritingEx Trace TracingEx RecSummaryEx Appendix: Sorting ================= .. toctree:: :numbered: :maxdepth: 3 InSort SortNotation Comparison InsertionSort BubbleSort SelectionSort Quicksort Appendix ======== .. toctree:: :numbered: :maxdepth: 3 Glossary Bibliography .. toctree:: :maxdepth: 3 * :ref:`genindex` * :ref:`search`