给定一个整型数组, 实现冒泡排序(升序排序)

package kkkk;

import java.util.Arrays;

public class WER {
public static void main(String[] args) {
int[] arr = {3, 34, 43, 45, 54, 12};
bubbleSort(arr);
System.out.println(Arrays.toString(arr));
}
public static void bubbleSort(int[] arr1) {
for (int a = 0; a < arr1.length; a++) {
for (int b = arr1.length - 1; b > a; b–) {
if (arr1[b - 1] > arr1[b]) {
int tmp = arr1[b - 1];
arr1[b - 1] = arr1[b];
arr1[b] = tmp;
}
}
}
}
}

发布了56 篇原创文章 · 获赞 0 · 访问量 540

猜你喜欢

转载自blog.csdn.net/keithendnasjkf/article/details/104447631