-
Notifications
You must be signed in to change notification settings - Fork 310
/
Copy pathorder_statistic.py
48 lines (34 loc) · 1.08 KB
/
order_statistic.py
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
def order_statistic(a, k):
"""returns the k-th (0 <= k < len(a)) largest element of a"""
left, right = 0, len(a) - 1
while True:
if right <= left + 1:
if (right == left + 1) and (a[right] < a[left]):
a[left], a[right] = a[right], a[left]
return a[k]
mid = (left + right) // 2
a[mid], a[left + 1] = a[left + 1], a[mid]
if a[left] > a[right]:
a[left], a[right] = a[right], a[left]
if a[left + 1] > a[right]:
a[right], a[left + 1] = a[left + 1], a[right]
if a[left] > a[left + 1]:
a[left], a[left + 1] = a[left + 1], a[left]
i, j = left + 1, right
cur = a[left + 1]
while True:
i += 1
while a[i] < cur:
i += 1
j -= 1
while a[j] > cur:
j -= 1
if i > j:
break
a[i], a[j] = a[j], a[i]
a[left + 1] = a[j]
a[j] = cur
if j >= k:
right = j - 1
if j <= k:
left = i