Today I have two printed handouts:
  info: course information (not a great syllabus)
   hw1: first homework, written part only, due in 8 days
        expect a program part for hw1 on Friday

Today we continue our review of the binary heap, in particular the
array representation, the swim and sink operations, and finally
its application for heapsort.   By the following summary, we see
that heapsort has some tradeoffs when compared to both mergesort
and quicksort:

 heapsort:   O(n lg n) worst case, O(1) extra space,    not stable
 mergesort:  O(n lg n) worst case, O(n) extra space,    stable
 quicksort:  O(n^2) worst case,    O(lg n) extra space, not stable
             [but expected is O(n lg n)]

We continue with the lecture notes from last time:
    24PriorityQueues.pdf --- pages 16 to about
    (also there are two .mov animations)