public class MaoPao {
public static void main(String[] args) {
int[] arr= {12,1,4,23,45,8,3,15};
System.out.println(Arrays.toString(arr));//输出数组排序前
for (int i = 0; i < arr.length-1; i++) {
for (int j = 0; j < arr.length-1; j++) {
if(arr[j]>arr[j+1]) {
int temp;
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
System.out.println(Arrays.toString(arr));//输出数组排序后
}
}
java 冒泡排序
最新推荐文章于 2023-05-16 10:19:40 发布