基本冒泡:
public void sort(int array[]) {
int tmp = 0;
for (int i = 0; i < array.length; i++) {
for (int j = 0; j < array.length - i - 1; j++) {
if (array[j] > array[j + 1]) {
tmp = array[j];
array[j] = array[j + 1];
array[j + 1] = tmp;
}
}
}
}
优化冒泡:
public void sort1(int array[]) {
int tmp = 0;
for (int i = 0; i < array.length; i++) {
//有序标记,每一轮的初始值是true
boolean isSorted = true;
for (int j = 0; j < array.length - i - 1; j++) {
if (array[j] > array[j + 1]) {
tmp = array[j];
array[j] = array[j + 1];
array[j + 1] = tmp;
//有元素交换说明没有序 标记为fasle
isSorted = false;
}
}
if (isSorted) {
break;
}
}
}
再优化冒泡:
public void sort2(int array[]) {
int tmp = 0;
//记录最后一次交换的位置
int lastExchangeIndex = 0;
//无序数列的边界,每次比较只需比较到这为止
int sortBorder = array.length - 1;
for (int i = 0; i < array.length; i++) {
boolean isSorted = true;
for (int j = 0; j < sortBorder; j++) {
if (array[j] > array[j + 1]) {
tmp = array[j];
array[j] = array[j + 1];
array[j = 1] = tmp;
//有元素交换,所以不是有序,标记为false
isSorted = false;
//把无序数列的边界更新为最后一次交换元素的位置
lastExchangeIndex = j;
}
}
sortBorder = lastExchangeIndex;
if (isSorted) {
break;
}
}
}