冒泡排序法

//定义数组

int num[] = new int[10];

//初始化数组

Random random = new Random();

for(int i=0;i<10;i++){

num[i] = random.nextInt(100);

}

System.out.println(Arrays.toString(num));

//排序

int out,in;

for(out = num.length - 1; out > 1; out--){

for(in = 0; in < out; in ++){

int temp = num[in];

if(num[in] > num[in+1]){

num[in] = num[in + 1];

num[in+1] = temp;

}

}

}

System.out.println(Arrays.toString (num));

冒泡排序发需对比N*N次，移动N*N次