【java】快速排序+二分查找实现

class Main {
    //快速排序
    public static void Qsort(int[] ints, int low, int high) {
        if (low >= high) {
            return;
        }
        int r = high;
        int l = low;
        int sta = ints[low];
        while (l < r) {
            while (l < r && ints[r] >= sta) {
                r--;
            }
            ints[l] = ints[r];
            while (l < r && ints[l] <= sta) {
                l++;
            }
            ints[r] = ints[l];
        }
        ints[r] = sta;
        Qsort(ints, low, r - 1);
        Qsort(ints, r + 1, high);
    }

    //二分查找
    public static int[] BSearch(int[] ints, int n, int low, int high) {
        int[] res = {-1, -1};
        if (low > high) {
            return res;
        }
        while (low <= high) {
            //防止数字过大越界
            int mid = (high - low) / 2 + low;
            if (ints[mid] == n) {
                res[0] = mid;
                res[1] = n;
                return res;
            }
            if (ints[mid] < n) {
                low = mid + 1;
            } else {
                high = mid - 1;
            }
        }
        return res;
    }

    //生成数组
    public static int[] RandomList(int n, int scope) {
        int[] ints = new int[n];
        Random random = new Random();
        for (int i = 0; i < n; i++) {
            ints[i] = random.nextInt(scope);
        }
        System.out.println(Arrays.toString(ints));
        return ints;
    }

    public static void main(String[] args) {
        int[] ints = RandomList(10, 100);
        Qsort(ints, 0, ints.length - 1);
        System.out.println(Arrays.toString(ints));
        System.out.println(Arrays.toString(BSearch(ints, 50, 0, ints.length - 1)));
    }
}

如有任何问题，请指正，感谢各位大佬观看。