.. _ToDo:

.. raw:: html

   <script>ODSA.SETTINGS.DISP_MOD_COMP = False;ODSA.SETTINGS.MODULE_NAME = "ToDo";ODSA.SETTINGS.MODULE_LONG_NAME = "ToDo";ODSA.SETTINGS.MODULE_CHAPTER = ""; ODSA.SETTINGS.BUILD_DATE = "2016-08-29 17:41:29"; ODSA.SETTINGS.BUILD_CMAP = false;</script>


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


.. index:: ! todo

TODO List
=========
.. raw:: html

   <hr /><h1>No Category</h1><hr />

.. raw:: html

   <h2><a href="ListADT.html#todo0">source: ListADT</a></h2>

.. TODO::

   :tag: Exercise

   This exercise ought to get expanded to a much richer set of
   variations on the question.

.. raw:: html

   <h2><a href="ExchangeSort.html#todo0">source: ExchangeSort</a></h2>

.. TODO::

   :tag: Revision

   Rewrite along these lines: Here are two measures of "out of order":
   inversions and min-swaps. Selection sort (especially w/
   optimization) meets min-swaps, but that's not a useful measure in
   general. Insertion sort tracks inversions, it is I + n. Now, if we
   had an exchange sort, what would cost be? Go on to the proof.

.. raw:: html

   <h2><a href="SortOpt.html#todo0">source: SortOpt</a></h2>

.. TODO::

   :tag: Revision

   Rewrite along these lines: A classic form of code tuning is "test
   to save work". For each of our three sorting algorithms, we have a
   potential "test to save work" "optimization". The question is: When
   is the cost of test worth the work saved? Let's look at each of the
   three.

.. raw:: html

   <hr /><h1>AV</h1><hr />

.. raw:: html

   <h2><a href="AnalIntro.html#todo0">source: AnalIntro</a></h2>

.. todo::

   :type: AV

   To make students more engaged in the GrowthRates exercise, we may
   need a tool that allows students to input two growth rate functions.
   Then the tool should plot the graph of both functions and mark
   their crossing point. The student also should be allowed to play
   with the constant values for both functions and see that this only
   changes the crossing point but doesn't change which function grows
   faster than the other.

.. raw:: html

   <hr /><h1>Exercise</h1><hr />

.. raw:: html

   <h2><a href="ListDouble.html#todo0">source: ListDouble</a></h2>

.. TODO::

   :type: Exercise

   Need exercises for inserting to and deleting from doubly linked lists.

.. raw:: html

   <h2><a href="HuffProof.html#todo0">source: HuffProof</a></h2>

.. TODO::

   :type: Exercise

   Battery of MCQs for content.

.. raw:: html

   <h2><a href="Quicksort.html#todo0">source: Quicksort</a></h2>

.. TODO::

   :type: Exercise

   Consider the Quicksort implementation for this module, where the
   pivot is selected as the middle value of the partition.
   Give a permutation for the values 0 through 7 that will cause
   Quicksort to have its worst-case behavior.

   There are a number of possible correct answers. To assess the
   answer, will need to run Quicksort over student's
   partition, and verify that at each step it will generate new
   partitions of size 6, 5, 4, 3, 2, then 1.

.. raw:: html

   <hr /><h1>Figure</h1><hr />

.. raw:: html

   <h2><a href="SelectionSort.html#todo0">source: SelectionSort</a></h2>

.. TODO::

   :type: Figure

   Replace with with a JSAV version of the figure

.. raw:: html

   <hr /><h1>Slideshow</h1><hr />

.. raw:: html

   <h2><a href="AnalProgram.html#todo0">source: AnalProgram</a></h2>

.. todo::

   :type: Slideshow

   We need to think about a technique for visualizing the running time
   of some loop constructs. This can be very similar to how we
   visualize reaching the closed form solution of summations.

.. raw:: html

   <h2><a href="SortNotation.html#todo0">source: SortNotation</a></h2>

.. TODO::

   :type: Slideshow

   The preceding paragraph could be turned into a slideshow.