package practice;
import java.util.Arrays;
public class Demo {
public static void main(String[] args) {
int[] arr = {13,54,62,11,20,1,8,34,43,21,56};
ascSort(arr);
descSort(arr);
}
public static void ascSort(int[] nums){ //冒泡升序
//设定排序轮数
for (int i = 0; i < nums.length - 1; i++){
//每排序一轮下一轮就少比较一次
for (int j = 0; j < nums.length - i -1; j++){
if (nums[j] > nums[j + 1]){
int num = nums[j + 1];
nums[j + 1] = nums[j];
nums[j] = num;
}
}
}
System.out.println(Arrays.toString(nums));
}
public static void descSort(int[] nums){ //冒泡降序
for (int i = 0; i < nums.length - 1; i++){
for (int j = 0; j < nums.length - i -1; j++){
if (nums[j] < nums[j + 1]){
int num = nums[j + 1];
nums[j + 1] = nums[j];
nums[j] = num;
}
}
}
System.out.println(Arrays.toString(nums));
}
}
定义方法对数组排序——冒泡排序
猜你喜欢
转载自blog.csdn.net/yl23921/article/details/126750536
今日推荐
周排行