折半查找、冒泡排序和选择排序

/**
     * @param data
     * @param value
     * @return
     * 折半查找
     */
    private static int binarySearch(int[] data, int value) {
        int min = 0;
        int max = data.length - 1;
        while (min <= max) {
            int mid = (min + max) / 2;
            if (data[mid] == value) {
                return mid;
            } else if (data[mid] < value) {
                min = mid + 1;
            } else if (data[mid] > value) {
                max = mid - 1;
            }
        }
        return -1;
    }
    
    /**
     * @param arr
     * 冒泡排序
     */
    private static void bubbleSort(int[] arr) {
        for (int i = 0; i < arr.length - 1; i++) {
            for (int j = 0; j < arr.length - 1 - i; j++) {
                if (arr[j] > arr[j + 1]) {
                    int temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
        }
    }
    
    /**
     * @param arr
     * 选择排序
     */
    private static void selectSort(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;
                }
            }
        }
    }