public static void main(String[] args){
int[] arr = new int[]{-31,0,5,9,74,591,940};
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
}
一维数组的冒泡排序
最新推荐文章于 2024-08-27 23:09:17 发布