View Code of Problem 49

#include <stdio.h>
int main()
{
    int n,a[20],max,min,i,p,q,b;
    scanf("%d",&n);
    for(i = 0;i < n;i++)
        scanf("%d",&a[i]);
    max = a[0];min = a[0];p = 0;q = 0;
    for(i = 1;i < n;i++)
    {
        if(max < a[i])
        {
            max = a[i];
            p = i;
        }
        if(min > a[i])
        {
            min = a[i];
            q = i;
        }
    }
    b = a[q];
    a[q] = a[0];
    a[0] = b;
    b = a[p];
    a[p] = a[n-1];
    a[n-1] = b;
    for(i = 0;i < n;i++)
        if(i != n-1)
        printf("%d ",a[i]);
    else
        printf("%d",a[i]);
    printf("\n");

}