1、问题
在一个数组S中查找第k小的元素并输出。
2、解析
3、设计
import java.util.Arrays;
/**
* @Description
* @Author ZhengLing
* @Date 2021/04/19 15:15
*/
public class SmallK {
static int r = 5;
private static int select(int[] A, int low, int high, int k) {
int num = high - low + 1;
int group = (int) Math.ceil(1.0 * num / r);
//姣忎釜鍒嗙粍鎺掑簭锛屽瓨浜嶮[]
int[] M = new int[group];
for (int i = 0; i < group; i++) {
Arrays.sort(A, low + r * i, low + r * i + (num > r * i + r ? r : num - i * r));
M[i] = A[low + r * i + (num > r * i + r ? r : num - i * r) / 2];
}
//閫塎[]鐨勪腑浣嶆暟m
int mid = M.length <= 2 ? M[0] : select(M, 0, M.length - 1, M.length / 2);
int[] S1 = new int[num];//灏忎簬mid鐨勬暟
int[] S2 = new int[num];//澶т簬mid鐨勬暟
int numS1, numS2, numS3;
numS1 = numS2 = numS3 = 0;
//瀵规暟杩涜鍒嗙粍
for (int i = low; i <= high; i++) {
if (A[i] < mid) {
S1[numS1++] = A[i];
} else if (A[i] == mid) {
numS3++;
} else {
S2[numS2++] = A[i];
}
}
if (numS1 >= k) {
//灏忎簬mid鐨勬暟鐨勬暟閲忓澶т簬绛変簬k
return select(S1, 0, numS1 - 1, k);
} else if (numS1 + numS3 >= k) {
return mid;
} else {
//灏忎簬绛変簬mid鐨勬暟鐨勬暟閲忓皬浜巏
return select(S2, 0, numS2 - 1, k - numS1 - numS3);
}
}
}
4、分析
W ( n ) = O ( n ) W(n) = O(n) W(n)=O(n)