import java.util.Arrays;
class MP {
public static void Mppx(int[] array) {
boolean flg = false;
//趟数
for (int i = 0; i < array.length - 1; i++) {
//次数
for (int j = 0; j < array.length - 1 - i; j++) {
if (array[j] > array[j + 1]) {
int temp = array[j + 1];
array[j + 1] = array[j];
array[j] = temp;
flg = true;
}
}
if (flg = false) {
return;
}
}
}
public static void main(String[] args) {
int[] array = {9, 5, 2, 7, 12, 10, 1, 4, 23};
Mppx(array);
System.out.println(Arrays.toString(array));
}
}
==============================================
输出结果:
[1, 2, 4, 5, 7, 9, 10, 12, 23]
java 冒泡排序代码优化
最新推荐文章于 2023-01-30 17:38:21 发布