C语言 实验7-1-5 选择法排序 (20分)

 

#include<stdio.h>
int main(void)
{
	int n,a[10],i,j,t;
	scanf("%d", &n);
	for (i=0; i<n; i++)
		scanf("%d", &a[i]);
		
	for (i=0; i<n-1; i++){           //最后一个数字无需排序，故到 n-1即可 
		for (j=i+1; j<n; j++){
			if (a[j] > a[i]){     //若有比 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;
}