Java排序一(冒泡排序)

冒泡排序

import java.util.Arrays;
/**
 * 冒泡排序
 */
public class BubbleSortDemo {
    public static void main(String[] args) {
        int[] arr1 = {};
        int[] ints1 = bubbleSortAscendingOrder(arr1);
        System.out.println(Arrays.toString(ints1));   //[]

        int[] arr2 = {2};
        int[] ints2 = bubbleSortAscendingOrder(arr2);
        System.out.println(Arrays.toString(ints2));   //[2]

        int[] arr3 = {6, 5, 4, 3, 2, 1, 0};
        int[] ints3 = bubbleSortAscendingOrder(arr3);
        System.out.println(Arrays.toString(ints3));   //[0, 1, 2, 3, 4, 5, 6]


        int[] arr4 = {0, 1, 2, 3, 4, 5, 6};
        int[] ints4 = bubbleSortDescendingOrder(arr4);
        System.out.println(Arrays.toString(ints4));   //[6, 5, 4, 3, 2, 1, 0]
    }

    /*
    升序
     */
    public static int[] bubbleSortAscendingOrder(int[] array) {
        if (array.length == 0 || array.length == 1) {
            return array;
        }
        for (int i = 0; i < array.length - 1; i++) {
            for (int j = 0; j < array.length - 1 - i; j++) {
                int temp;
                if (array[j] > array[j + 1]) {
                    temp = array[j + 1];
                    array[j + 1] = array[j];
                    array[j] = temp;
                }
            }
        }
        return array;
    }

    /*
    降序
   */
    public static int[] bubbleSortDescendingOrder(int[] array) {
        if (array.length == 0 || array.length == 1) {
            return array;
        }
        for (int i = 0; i < array.length - 1; i++) {
            for (int j = 0; j < array.length - 1 - i; j++) {
                int temp;
                if (array[j] < array[j + 1]) {
                    temp = array[j + 1];
                    array[j + 1] = array[j];
                    array[j] = temp;
                }
            }
        }
        return array;
    }
}