package sort;
public class myBubbleSort {
public static void main(String[] args) {
bubble1sort();
System.out.println("=====增加exchange标志=======");
bubble1sortImproved();
}
public static void bubble1sort() {
int array[] = { 5, 3, 8, 6, 13, 24, 9, 21, 17, 16, -3 };
for (int i = 0; i < array.length - 1; i++) {
for (int j = 1; j < array.length - i; j++) {
if (array[j] > array[j - 1]) {// 更改大于小于改变排序顺序
int temp = array[j];
array[j] = array[j - 1];
array[j - 1] = temp;
}
}
System.out.println("第" + (i + 1) + "趟排序后结果:");
ArrayUtils.printArray(array);
}
}
public static void bubble1sortImproved() {
int array[] = { 5, 3, 8, 6, 13, 24, 9, 21, 17, 16, -3 };
for (int i = 0; i < array.length - 1; i++) {
boolean exchange = false;
for (int j = 1; j < array.length - i; j++) {
if (array[j] > array[j - 1]) {// 更改大于小于改变排序顺序
exchange = true;
int temp = array[j];
array[j] = array[j - 1];
array[j - 1] = temp;
}
}
System.out.println("第" + (i + 1) + "趟排序后结果:");
ArrayUtils.printArray(array);
if (exchange == false)
return;
}
}
}
结果如下:
第1趟排序后结果:
{5, 8, 6, 13, 24, 9, 21, 17, 16, 3, -3}
第2趟排序后结果:
{8, 6, 13, 24, 9, 21, 17, 16, 5, 3, -3}
第3趟排序后结果:
{8, 13, 24, 9, 21, 17, 16, 6, 5, 3, -3}
第4趟排序后结果:
{13, 24, 9, 21, 17, 16, 8, 6, 5, 3, -3}
第5趟排序后结果:
{24, 13, 21, 17, 16, 9, 8, 6, 5, 3, -3}
第6趟排序后结果:
{24, 21, 17, 16, 13, 9, 8, 6, 5, 3, -3}
第7趟排序后结果:
{24, 21, 17, 16, 13, 9, 8, 6, 5, 3, -3}
第8趟排序后结果:
{24, 21, 17, 16, 13, 9, 8, 6, 5, 3, -3}
第9趟排序后结果:
{24, 21, 17, 16, 13, 9, 8, 6, 5, 3, -3}
第10趟排序后结果:
{24, 21, 17, 16, 13, 9, 8, 6, 5, 3, -3}
=====增加exchange标志=======
第1趟排序后结果:
{5, 8, 6, 13, 24, 9, 21, 17, 16, 3, -3}
第2趟排序后结果:
{8, 6, 13, 24, 9, 21, 17, 16, 5, 3, -3}
第3趟排序后结果:
{8, 13, 24, 9, 21, 17, 16, 6, 5, 3, -3}
第4趟排序后结果:
{13, 24, 9, 21, 17, 16, 8, 6, 5, 3, -3}
第5趟排序后结果:
{24, 13, 21, 17, 16, 9, 8, 6, 5, 3, -3}
第6趟排序后结果:
{24, 21, 17, 16, 13, 9, 8, 6, 5, 3, -3}
第7趟排序后结果:
{24, 21, 17, 16, 13, 9, 8, 6, 5, 3, -3}
一般算法:N个元素的数组,一共需要n-1趟,第一趟,实际上是找出了最小(大)的元素,移动到了数组末尾,这个元素的顺序已经好了,接下来,实际是排前面n-1个元素的顺序,所以j取值范围是j<array.leng-i;