wanted to ask if someone can confirm me that there is no initial configuration of an array A of length n that will result in linear running time of heapsort, because the running time of heapsort on an array A of length n regardless of the initial configuration is O (nlgn) because even though it is already sorted or not, it will be transformed back into a heap and sorted again.
Is my assumption right?
Thanks, f.g.