View Code of Problem 49

#include<stdio.h>
#include<math.h> 
int main(){
	int i,j,n,x,d,a[10],temp1,temp2;

	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	int min=a[0];
	int max=a[0];
	for(j=0,i=0;j<n,i<n;j++,i++){
		if(min>a[j]){
			min=a[j];
			x=j;
			
		}
		if(max<a[i]){
			max=a[i];
			d=i;
		}
	}
	temp1=a[0];
	a[0]=a[x];
	a[x]=temp1;
	
	temp2=a[n-1];
	a[n-1]=a[d];
	a[d]=temp2;
	
	
	for(i=0;i<n;i++){
		printf("%d ",a[i]);
	} 
	return 0;
}