How We can Avoid Using Extra work in Heap Sort Algorithm to find Second Largest Element in an array?

Heap sort takes O(n Logn) time for sorting n length heap. To obtain second largest element you should use heapify twice. Second number is what you looking for.

It takes 2 * logn (heapify) time. Complexity is O(logn) .

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.