冒泡排序法(\t的功能是是空出空格,补齐8个)

include

/* run this program using the console pauser or add your own getch, system(“pause”) or input loop */

int main() {
int i,j;
int a[5]={10,1,14,133,15};
for( i=0;i<5;i++)
{
for( j=0;j<5-1-i;j++)
{if (a[j]>a[j+1])
{
int t;
t=a[j+1];
a[j+1]=a[j];
a[j]=t;}

	}}
	for( i=0;i<5;i++)
	printf("%d\t",a[i]);
return 0;

}