package com.dk.排序;
import java.util.Arrays;
public class MaoPaoSort {
public static void main(String[] args) {
int length = 1000;
int[] ints = new int[length];
for (int i = 0; i < length; i++) {
ints[i] = (int) (Math.random() * 1000);
}
System.out.println(Arrays.toString(ints));
System.out.println();
int temp = 0;
boolean flag = false;
for (int i = 0; i < length - 1; i++) {
for (int j = 0; j < length - 1 - i; j++) {
if (ints[j] > ints[j + 1]) {
temp = ints[j];
ints[j] = ints[j + 1];
ints[j + 1] = temp;
flag = true;
}
}
if (!flag) {
break;
}
System.out.println(Arrays.toString(ints));
}
}
}
冒泡排序java
于 2022-10-16 22:53:35 首次发布