C语言经典算法：冒泡排序

#include<stdio.h>
#include<conio.h>
#defineTURE1
#defineFLASE0
voidBubbleSort(inta[],intn)
{
inti,j;
intchange;
inttemp;
for(i=n-1,change=TURE;i>=1&&change;i--)
{
change=FLASE;
for(j=1;j<=i;j++)
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
change=TURE;
}
}
}
voidPrint(inta[],intn)
{
inti;
for(i=1;i<=n;i++)
printf("a[%d]=%d",i,a[i]);
}
main()
{
inta[100];
inti,n;
printf("/nInputtheLength:/n");
scanf("%d",&n);
printf("/nInputthenumber:/n");
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
printf("/nBefore:/n");
Print(a,n);
BubbleSort(a,n);
printf("/nAfter:/n");
Print(a,n);
getch();
printf("Pressanykeytocontinue...");
clrscr();
}