冒泡排序
int[] array = {2,6,1,0,9,3,5};
for(int i=0;i<array.length;i++){
for(int j=0;j<array.length-i-1;j++){
int a = array[j];
if(array[j]>array[j+1]){
array[j] = array[j+1];
array[j+1] = a;
}
}
}
for(int i=0;i<array.length;i++){
System.out.println(array[i]);
}
}
0 1 2 3 5 6 9