I think , if we want the maximum number of comparisons to be made for an element then let us assume that element to be the comapared is the biggest in the given array , so at level 0 , 2^0 comparison is done
At level 1, 2^1 comparisons will be done
At level 2, 2^2 comparisons will be done
.
.
.
Similarly at kth level 2^k comparison will be done .
Therefore total number of comparisons made will be summation of all the comparisons.
Plz comment if this analysis is wrong
.