冒泡排序法的java实现

import java.util.Arrays;

public class Ts {
public static void main(String[] args) {
int[]b={2,4,1,6,9,3,5,1};
int n=b.length;
long st=System.currentTimeMillis();
for (int i =0; i<(b.length-1); i++) {
for (int j = 0; j <n-1; j++) {
if(b[j]>b[j+1]){
int tem=b[j+1];
b[j+1]=b[j];
b[j]=tem;
}
}
}
System.out.println(Arrays.toString(b));
long en=System.currentTimeMillis();
System.out.println(“方法二耗时:”+(en-st));
System.out.println("------------------------");
}
}