import java.util.Arrays;
public class Test {
public static void main(String[] args) {
int[] arr={32,45,77,7,43,76};
bubbleSort(arr);
System.out.println(Arrays.toString(arr));
}
private static void bubbleSort(int[] arr) {
for (int i = 0; i < arr.length-1; i++) {
for (int j = 0; j < arr.length-i-1; j++) {
if(arr[j]>arr[j+1]){
int t=arr[j];
arr[j]=arr[j+1];
arr[j+1]=t;
}
}
}
}
}
冒泡排序法
最新推荐文章于 2022-09-19 20:37:09 发布