基础排序算法

public class Sort {

    public static void quickSort(Integer[] arr, int low, int high) {
        int temp = arr[low];
        int i = low;
        int j = high;
        if (low >= high) {
            return;
        }
        while (i != j) {
            while (i < j && arr[j] >= temp) {
                j--;
            }
            while (i < j && arr[i] <= temp) {
                i++;
            }
            if (i < j) {
                int flag = arr[j];
                arr[j] = arr[i];
                arr[i] = flag;
            }
        }
        arr[low] = arr[i];
        arr[i] = temp;

        quickSort(arr, low, i - 1);
        quickSort(arr, i + 1, high);
    }

    public static void bubbleSort(Integer[] arr) {
        int count = arr.length;
        if (count == 0) {
            return;
        }
        for (int i = 0; i < count - 1; i++) {
            boolean flag = true;
            for (int j = 0; j < count - 1 - i; j++) {
                if (arr[j] > arr[j + 1]) {
                    int temp = arr[j + 1];
                    arr[j + 1] = arr[j];
                    arr[j] = temp;
                    flag = false;
                }
            }
            if(flag) break;
        }
    }

    public static int binarySearch(Integer[] arr, int key, int low, int high) {
        if (key < arr[low] || key > arr[high] || low > high) {
            return -1;
        }
        int mid = (low + high) / 2;
        if (key == arr[mid]) {
            return mid;
        }
        if (key < arr[mid]) {
            return binarySearch(arr, key, low, mid - 1);
        }
        if (key > arr[mid]) {
            return binarySearch(arr, key, mid + 1, high);
        }
        return -1;

    }

    public static void main(String[] args) {
        Integer[] arr = {1, 6, 8, 7, 3, 5, 16, 4, 8, 36, 13, 44};
//        Integer[] arr = {6, 8, 7, 3, 5, 9};
//        quickSort(arr, 0, arr.length - 1);
        bubbleSort(arr);
        for (int i : arr) {
            System.out.print(i + " ");
        }
    }

}