冒泡排序

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

转载于:https://www.cnblogs.com/yyf573462811/archive/2012/07/27/6365361.html