Find Second largest number in array at most n+log₂(n)−2 comparisons [closed]

Answer 1

Why not to use this hashing algorithm for given array[n]? It runs c*n, where c is constant time for check and hash. And it does n comparisons.

    int first = 0;
    int second = 0;
    for(int i = 0; i < n; i++) {
        if(array[i] > first) {
            second = first;
            first = array[i];
        }
    }

Or am I just do not understand the question...