For the set of numbers {1,2,3,4,5,6,7} which input gives the best/worst case for the heapsort algorithm. Here complexity is based on number of comparisons made throughout including the building of the MAX heap. for each case (best, and worst) give the sequence of comparisons made.

I am asking using heapsort what sequence of numbers gives the most amount of comparisons also which sequence give the least amount of comparisons. comparisons within the heapsort algorithm like when you compare with children.