数组排序之冒泡排序

package ss1;

/**
 *  数组排序之冒泡排序
*/
public class Menu {
 public static void main(String[] args) {
 int [] arr ={23,45,12,80,76};
 System.out.println(arrToString(arr));
 int[] a = arrPaiXu(arr);
 System.out.println(arrToString(a));
   }
 public static int[] arrPaiXu(int[] arr){
   for (int i = 0; i < arr.length-1; i++) {
   for (int j = 0; j < arr.length-1-i; j++) {
    if (arr[j]>arr[j+1]) {
     int temp = arr[j];
     arr[j] =arr[j+1];
     arr[j+1] =temp;
    }
   }
  }
  return arr;
 }
 
 public static String arrToString(int[] arr){
  String s ="{";
  for (int i = 0; i < arr.length; i++) {
   if (i == arr.length-1) {
    s += arr[i]+" }";
   } else {
    s+=arr[i]+", ";
   }
  }
  return s;
 }
}

结果:

{23, 45, 12, 80, 76 }
{12, 23, 45, 76, 80 }