package com.yang.java;
public class ArrayTest {
public static void main(String[] args) {
int[]arr=new int[] {12,32,3,-1,54};
//冒泡排序
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 temp=arr[j];
arr[i]=arr[j+1];
arr[j+1]=temp;
}
}
}
for (int j = 0; j < arr.length; j++) {
System.out.print(arr[j]+" ");
}
}
}
冒泡排序
最新推荐文章于 2023-07-15 11:56:45 发布