Java方法数组元素冒泡排序

public class test{
  public static void main(String[] args){
    int[] arr={241,512,123,12,3512,123,1521,1321,515,-12,421,-123,0,4,12442};
    System.out.print("初始数组:");
    printArray(arr);
    System.out.print("冒泡排序后数组:");
    bubbleStor(arr);
    printArray(arr);
  }
  public static void bubbleStor(int[] arr){
    for(int i=0;i<arr.length-1;i++){
      for(int j=0;j<arr.length-i-1;j++){
        if(arr[j]>arr[j+1]){
          int temp=arr[j];
          arr[j]=arr[j+1];
          arr[j+1]=temp;
        }
      }
    }
  }
  public static void printArray(int[] arr){
    System.out.print("[");
    for(int i=0;i<arr.length;i++){
      if(i==arr.length-1){
        System.out.println(arr[i]+"]");
      }
      else{
        System.out.print(arr[i]+",");
      }
    }
  }
}

输出结果：
初始数组:
[241,512,123,12,3512,123,1521,1321,515,-12,421,-123,0,4,12442]
冒泡排序后数组:
[-123,-12,0,4,12,123,123,241,421,512,515,1321,1521,3512,12442]