java排序

冒泡排序

public static void mapao(){   int[] a = {3,2,5,34,57,12,7,18,26,22};   int temp = 0;   for(int i = 0; i < a.length; i++){      for(int j = 1; j < a.length - i; j++){         if(a[j] < a[j-1]){//做交换，升序            temp = a[j - 1];            a[j - 1] = a[j];            a[j] = temp;         }      }   }   System.out.println(Arrays.toString(a));}