Java算法之冒泡排序实例代码

public class Two { public static void main(String[] args) {   int arg[] = {25,36,15,274};   sort(arg);} private static void sort(int[] array) {   for (int j = 1; j < array.length;j++) {   for (int i = 0; i < array.length-i; i++) {    if (array[i]>array[i+1]) {    //下面是重点      int x=array[i];      array[i]=array[i+1];      array[i+1]=x;    }    }   } sortArray(array);  }  //排序方法 private static void sortArray(int[] array) {  for(int i:array) {    System.out.println(i);  }}}