[Java] 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);
  }
}
}