int a[]=new int[]{3,1,6,0,4,5,2,9,8,7};
int i,j,t;
for(i=0;i<10;i++){
for (j = 0; j < 9 - i; j++){
if (a[j] > a[j + 1]) {
t = a[j];
a[j] = a[j + 1];
a[j+1] = t;
}
}
}
for (i=0;i<10;i++)
System.out.println("a["+i+"]="+a[i]);
int i,j,t;
for(i=0;i<10;i++){
for (j = 0; j < 9 - i; j++){
if (a[j] > a[j + 1]) {
t = a[j];
a[j] = a[j + 1];
a[j+1] = t;
}
}
}
for (i=0;i<10;i++)
System.out.println("a["+i+"]="+a[i]);
define maxsize 100
typedef struct
{int key;
int data;
}node;
typedef node rec[maxsize];
rec r;
冒泡:
bubblesort(rec r,int n)
{for(i=1;i<=n-1;i++)
{flag=1;
for(j=1;j<=n-i;j++)
{if(r[j].key>r[j+1].key)
{flag=0;
r[0]=r[i];r[j]=r[j+1];r[j+1]=r[0];
}}
if(flag)return;//若flag=1,则表示已经排好,返回
}}