冒泡排序和选择排序

package util;

public class ArraySorted {
    public static int[] sortArray(int[] arr) {

        for(int i=0;i<arr.length-1;i++) {
            for (int j=i+1;j<arr.length;j++) {

                    if (arr[i]>arr[j]) {
                        int temp = arr[i];
                        arr[i] = arr[j];
                        arr[j] = temp;
                    }
            }
        }
        return arr;
    }

    public static int[] sortArray(int[] arr,boolean isAsc) {

        for(int i=0;i<arr.length-1;i++) {
            for (int j=i+1;j<arr.length;j++) {
                if(isAsc) {
                    if (arr[i]>arr[j]) {
                        int temp = arr[i];
                        arr[i] = arr[j];
                        arr[j] = temp;
                    }
                }else {
                    if (arr[i]<arr[j]) {
                        int temp = arr[i];
                        arr[i] = arr[j];
                        arr[j] = temp;
                    }
                }
            }
        }
        return arr;
    }
    public static int[] bubbleSort(int[] arr) {//默认，选择
        for (int i=1;i<arr.length;i++) {
            for(int j=0;j<arr.length-i;j++) {
                if (arr[j]>arr[j+1]) {
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
        return arr;
    }
    public static int[] bubbleSort(int[] arr,boolean isAsc) {//冒泡排序
        for (int i=1;i<arr.length;i++) {
            for(int j=0;j<arr.length-i;j++) {
                if(isAsc) {
                    if (arr[j]>arr[j+1]) {
                        int temp = arr[j];
                        arr[j] = arr[j+1];
                        arr[j+1] = temp;
                    }
                }else {
                    if (arr[j]<arr[j+1]) {
                        int temp = arr[j];
                        arr[j] = arr[j+1];
                        arr[j+1] = temp;
                    }
                }
            }
        }
        return arr;

    }
}