题目
思路
利用快速排序,归并排序等时间复杂度为 n(nlogN)的排序算法,
本答案利用归并排序
答案
import java.util.*;
public class Solution {
public int findKth (int[] a, int n, int K) {
guibing(a);
return a[n - K];
}
public void guibing(int[] arr) {
int n = arr.length;
int step = 1;
while (step < n) {
int l = 0;
while (l < n) {
int m = l + step - 1;
if (m > n - 1) break;
int r = Math.min(m + step, n - 1);
merge(arr, l, m, r);
l = r + 1;
}
if (step > n / 2) break;
step *= 2;
}
}
public void merge(int[] arr, int l, int m, int r) {
int[] help = new int[r - l + 1];
int p1 = l, p2 = m + 1, i = 0;
while (p1 <= m && p2 <= r) {
if (arr[p1] <= arr[p2]) {
help[i++] = arr[p1++];
} else {
help[i++] = arr[p2++];
}
}
while (p1 <= m) {
help[i++] = arr[p1++];
}
while (p2 <= r) {
help[i++] = arr[p2++];
}
for (int j = 0; j < i; j++) {
arr[l + j] = help[j];
}
}
}