java 冒泡排序

package arr;
public class ArrSort{
public static void main(String[] args){
int t;
int [] arr={654,65,64,3,8,6,48,23}
System.out.printf(“排序前”);
for(int x:arr)System.out.printf(x+" “);
for(int n=0;n<arr.length-1;n++){ //遍历数组
for(int i=0;i<arr.length-(1+n);i++){
if(arr[i]>arr[i+1]){
t=arr[i+1];
arr[i+1]=arr[i];
arr[i]=t;
}
}
}
System.out.printf(“排序后”);
for(int x:arr)System.out.printf(x+” ");
}
}