CS 2213 Advanced Programming, Fall 2000 Programming Assignment 0 Comments

• See the notes from class on October 5.
• The sort had to be a heapsort.
  Just sorting the array was not sufficient.
• Heapsort does not use recursion.
• Several people had tests like:
  (2*i+1 < k) && (2*i+2 < k)
  If the second is satisfied, so is the first.
• Eschew obfuscation!
• If something depends on a trick to work, it must be documented.