无序整数数组冒泡法排序

package test;




public class Test {
public static void main(String[] args) {
int  arry[]={23,0,1,4,6,9,7,999,0};
int l=arry.length;
System.out.println("l="+l);
int temp=0;
for (int i = 0; i <l-1; i++) {//i 0--7
for (int j = 0; j <l-1 ; j++) {//j 0--7
if(arry[j]>arry[j+1]){//按从小到大排序
temp=arry[j];
arry[j]=arry[j+1];
arry[j+1]=temp;
}
}
}
for (int i = 0; i < arry.length; i++) {
System.out.println("arr["+i+"]="+arry[i]);
}
}

}