When I presented the Heap Data Structure, I explained how it stores its values in an array, A, but that A[0] is never used to store a value. Today I explained how heapsort can be used to sort an array...

When I presented the Heap Data Structure, I explained how it stores its values in an array, A, but that A[0] is never used to store a value. Today I explained how heapsort can be used to sort an array of A values by first converting it into a heap. How does heapsort not "lose the value" that is stored in A[0]?