简易冒泡排序的实现
public int[]
bubbleOrder(
int[] array) {
boolean flag =
true;
int temp
;
for (
int i =
0; i < array.
length; i++) {
for (
int j =
0; j < array.
length - i -
1; j++) {
if (array[j] > array[j+
1]) {
temp = array[j]
;
array[j] = array[j+
1]
;
array[j+
1] = temp
;
flag =
false;
}
}
if (flag) {
break;
}
flag =
true;
}
return array
;
}
转载请注明原文地址: https://www.6miu.com/read-442.html