7-6 选择法排序 (20分)

 

#include<stdio.h>
int main (void)
{
	int n,i,j,a[10],t;
	scanf("%d", &n);
	for (i=0; i<n; i++)
		scanf("%d", &a[i]);
	for (i=0; i<n-1; i++){
		for (j=i+1; j<n; j++){
			if (a[j]> a[i]){
				t = a[j];
				a[j] = a[i];
				a [i] = t;
			}
		}
	}
	printf("%d", a[0]);
	for (i=1; i< n; i++)
		printf(" %d",a[i]);

	return 0;
}