基本冒泡:
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;
}
}
}