General formula is $\left \lceil 3\frac{n}{2} -2\right \rceil$
Here is how it works
Take 2 pointers smallest and largest
Compare 1&2 element of array assign least element to smaller and greater element to largest
So for n=60
Total compressions=1
Now take element 3&4 compare
Compare least element with smaller and greatest element with largest
Continue so on
Eg 5,3,1,2
5>3. 1st comparison
Smaller=3 larger=5
Now 1<2 2nd comparison next 3<1 3rd compressions & 5>2 4th comparison
So total comparison 4
When n is odd 1 St element is assigned as small as well as largest and remaining procedure is same
So for n=60 = 3*60/2-2= 88