冒泡排序

 

int []a={6,4,3,1,56,8,9,12,45,32};

int temp;

for (int i=0;i<=9;i++)

{

for(int j=0;j<9-i;j++)

{

if(a[j]>a[j+1])

{

temp=a[j+1];

a[j+1]=a[j];

a[j]=temp;

}

}

}

for (int s: a){

System.out.println(s);

}