-
-
Notifications
You must be signed in to change notification settings - Fork 408
/
Copy pathQuickSelect.ts
105 lines (92 loc) · 2.19 KB
/
QuickSelect.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
/**
* [QuickSelect](https://www.geeksforgeeks.org/quickselect-algorithm/) is an algorithm to find the kth smallest number
*
* Notes:
* - QuickSelect is related to QuickSort, thus has optimal best and average case O(n) but unlikely poor worst case O(n^2)
* ----
* @complexity O(n) (on average)
* @complexity O(n^2) (worst case)
* ----
* @param items array
* @flow
*/
const QuickSelect = (items: Array<number>, kth: number): number => {
if (kth < 1 || kth > items.length) {
throw new RangeError("Index Out of Bound");
}
return RandomizedSelect(items, 0, items.length - 1, kth);
};
/**
* @param items
* @param left
* @param right
* @param i
* @returns number
*/
const RandomizedSelect = (
items: Array<number>,
left: number,
right: number,
i: number
): number => {
if (left === right) return items[left];
const pivotIndex = RandomizedPartition(items, left, right);
const k = pivotIndex - left + 1;
if (i === k) return items[pivotIndex];
if (i < k) return RandomizedSelect(items, left, pivotIndex - 1, i);
return RandomizedSelect(items, pivotIndex + 1, right, i - k);
};
/**
*
* @param items
* @param left
* @param right
* @returns
*/
const RandomizedPartition = (
items: Array<number>,
left: number,
right: number
): number => {
const rand = getRandomInt(left, right);
Swap(items, rand, right);
return Partition(items, left, right);
};
/**
*
* @param items
* @param left
* @param right
* @returns
*/
const Partition = (items: Array<number>, left: number, right: number) : number => {
const x = items[right];
let pivotIndex = left - 1;
for (let j = left; j < right; j++) {
if (items[j] <= x) {
pivotIndex++;
Swap(items, pivotIndex, j);
}
}
Swap(items, pivotIndex + 1, right);
return pivotIndex + 1;
};
/**
*
* @param min
* @param max
* @returns
*/
const getRandomInt = (min : number, max : number) : number => {
return Math.floor(Math.random() * (max - min + 1)) + min;
}
/**
*
* @param arr array
* @param x array element to swap
* @param y array element to swap
*/
const Swap = (arr : Array<number>, x : number, y : number) : void => {
[arr[x], arr[y]] = [arr[y], arr[x]];
}
export { QuickSelect };