public class Maopao {
public static void main(String[] args) {
//冒泡排序
int[] arr = new int[]{23,34,12,43,65,24,56,19,12,74,48};
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] + " ");
}
}
}
java 冒泡排序
最新推荐文章于 2023-05-16 10:19:40 发布