快速排序

private static int quickSelect(int a[], int l, int r, int k) {
    Random rand = new Random();
    int p = rand.nextInt(r - l + 1) + l;
    int x = a[p];
    int tmp = a[p];
    a[p] = a[r];
    a[r] = tmp;
    int i = l, j = r;
    while (i < j) {
        while (i < j && a[i] < x) i++;
        if (i < j) {
            a[j] = a[i];
            j--;
        }
        while (i < j && a[j] > x) j--;
        if (i < j) {
            a[i] = a[j];
            i++;
        }
    }
    a[i] = x;
    p = i;
    if (i - l + 1 == k) return a[i];
    if (i - l + 1 < k) return quickSelect(a,i+1,r,k);
    else return quickSelect(a, l, i - 1, k);
}