Untitled

mail@pastecode.io avatar
unknown
plain_text
3 years ago
810 B
314
Indexable
Never
#include<stdio.h>
void swap(long long *a, long long *b)
{
    long long tmp = *a;
    *a = *b;
    *b = tmp;

}
void quick(long long *a, int low, int high)
{
    long long mid = a[(low+high)/2];
    int l = low;
    int r = high;
    while(l < r)
    {
        while(a[l] < mid)
        {
            l++;
        }
        while(a[r] > mid)
        {
            r--;
        }
        swap(&a[l],&a[r]);
        l++;
        r--;
    }
    if(low < r)
    {
        quick(a,low,r);
    }
    if(l < high)
    {
        quick(a,l,high);
    }
}
int main()
{
    int n;
    scanf("%d", &n);
    long long a[10000];
    int i;
    for(i = 0;i<n;i++)
    {
        scanf("%lld", &a[i]);
    }
    quick(a,0,n-1);
    printf("%lld", a[n-1] - a[0]);
    return 0;
}