CareerCup

But all that is asked is the min. number of swaps required to sort, and in-place quick sort does the trick, I am not why that won't be optimal...
It sure is than bubble sort and solves in nlogn without extra space

Correct me if I am wrong

Algo:
i = 0, j = size-1

while(i<j)
{
while (a[i]> a[i+1]) i++
while (a[j]<a[j-]) j--;
if a[j]-a[i] > maxdiff
overwrite maxdiff
}

Correct me if I am wrong

Algo:
i = 0, j = size-1

while(i<j)
{
while (a[i]> a[i+1]) i++
while (a[j]<a[j-]) j--;
if a[j]-a[i] > maxdiff
overwrite maxdiff
}

select * from CUSTOMER C1 where (select count(*) from CUSTOMER C2 where C2.expenses > C1.expenses )<5 order by C1.expenses DESC;