private static void fun() {
int arr[]={9,8,6,4,3,5,7};
for (int i=1;i<arr.length-1;i++){
for (int j=0;j<arr.length-i-1;j++){
if (arr[j]>arr[j+1]){
int t=arr[j];
arr[j]=arr[j+1];
arr[j+1]=t;
}
}
}
for (int i=0;i<arr.length;i++){
System.out.print(arr[i]+" ");
}
如何完成一个冒泡排序private static void fun() { int arr[]={9,8,6,4,3,5,7}; for (int i=1;i<arr.length-1;i++){ for (int j=0;j<arr.length-i-1;j++){ if (arr[j]>arr[j+1]){ int t=arr[j];