JAVA冒泡排序的升序和降序

深究猿码

于 2022-06-17 11:15:33 发布

104

分类专栏： JAVASE知识文章标签： java 算法排序算法

本文链接：https://blog.csdn.net/weixin_43515260/article/details/125330175

版权

JAVASE知识专栏收录该内容

23 篇文章 0 订阅

订阅专栏

import java.util.Arrays;

public class test02_Arrays_sort {
    public static void main(String[] args) {

        //Arrays.sort()方法进行数组排序
        int [] arr ={15,36,12,14,2,6,98,26,11};
        Arrays.sort(arr);
        System.out.println(Arrays.toString(arr));

        System.out.println("------------------------");

        //冒泡排序
        int [] arr1 ={15,36,12,14,2,6,98,26,11};
        for (int i = 0; i <arr1.length -1; i++) {
            for (int j = 0; j <arr1.length-1-i ; j++) {
                if (arr1[j]>arr1[j+1]) {
                    int temp=arr1[j];
                    arr1[j]=arr1[j+1];
                    arr1[j+1]=temp;
                }
            }
        }
        System.out.println(Arrays.toString(arr1));
        System.out.println("------------------------");
        
        //冒泡降序
        int [] arrays={9,12,56,11,13,54,98,45,36,59,88};
        for (int i = 0; i <arrays.length-1 ; i++) {
            for (int j = 0; j <arrays.length-1-i ; j++) {
                if (arrays[j]<arrays[j+1]){
                    int temp=arrays[j];
                    arrays[j]=arrays[j+1];
                    arrays[j+1]=temp;
                }
            }
        }
        System.out.println(Arrays.toString(arrays));
    }
}