Answers

17. Heapsort requires less storage because it doesn't need an auxiliary array.
18. The MinHeap wastes the 0 entry to make the formulas more intuitive. When sorting an array, we don't want to waste the 0 entry, so we adjust the formulas instead.