Find the 2nd largest element in an array with minimum number of comparisons

Question

For an array of size N, what is the number of comparisons required?

Answer 1

A good way with O(1) time complexity would be to use a max-heap. Call the heapify twice and you have the answer.