day1
冒泡排序
package maopao;
public class mao {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] arr={34,2,65,89,12,54,32,27,76};
int temp=0;
for(int i=0;i<arr.length;i++){
for(int j=i+1;j<arr.length;j++){
if(arr[i]>arr[j]){
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
}
for(int i=0;i<arr.length;i++){
System.out.print(arr[i]+" ");
}
}
}