====== Week 13 ======

~~NOTOC~~


==== Tuesday ====

  * Today we will review code for the priority queue
    * {{ :courses:cs102-2021-01:cmpu102-lec12.pptx |Last week's lecture notes}}
    * [[https://docs.oracle.com/javase/8/docs/api/java/lang/Comparable.html|The Comparable interface documentation]]
    * {{ :courses:cs102-2021-01:cmpu102-priorityqueueproject.zip |min-priority queue, smaller number --> higher priority}}
  * ...and cover sorting methods
    * {{ :courses:cs102-2021-01:cmpu102-week13.pptx |Sorting Strategies}}



{{ :courses:cs102-2021-01:cmpu102-lec12.pptx |}}==== Thursday ====

<note important>Polynomial calculator homework assignment extension</note>
=== Due Date is now 12/8 at 11:59pm ===

  * I will set aside time in class for you to do a course evaluation
    *  go.vassar.edu/course/evals
  * and we will continue our discussion on sorting from Tuesday...
  * {{ :courses:cs102-2021-01:cmpu102-week13.pptx |Sorting Strategies}}
    * {{ :courses:cs102-2021-01:binarysearch.zip |The binary search algorithm}}
    * ... & //insert// a topic from last week's lecture notes: {{ :courses:cs102-2021-01:cmpu102-lec12.pptx |insertion sort}}
    * [[https://www.toptal.com/developers/sorting-algorithms|visual representation of sorting algorithms, including merge sort]]


  
==== Friday's Lab ====

just polynomial homework today