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
|
import math
def _none_if_null_len(func):
def tmp(xs, *args, **kwargs):
if len(xs) == 0:
return None
return func(xs, *args, **kwargs)
return tmp
@_none_if_null_len
def mean(xs):
return sum(xs) / len(xs)
@_none_if_null_len
def std(xs):
xs_mean = mean(xs)
return math.sqrt(sum(
[(x - xs_mean) ** 2 for x in xs]) / (len(xs) - 1))
@_none_if_null_len
def _pick(xs, compar):
m = xs[0]
for t in xs[1:]:
if compar(t, m):
m = t
return m
def min(xs):
return _pick(xs, lambda x, y: x < y)
def max(xs):
return _pick(xs, lambda x, y: x > y)
def _qsort(xs):
if len(xs) < 2:
return xs
xs = list(xs)
pivot = xs[0]
body = xs[1:]
return (_qsort([x for x in body if x < pivot])
+ [pivot]
+ _qsort([x for x in body if x >= pivot]))
def _need_sorted(func):
return lambda xs, *args, **kwargs: func(_qsort(xs), *args, **kwargs)
@_none_if_null_len
@_need_sorted
def q25(xs):
return xs[len(xs) // 4]
@_none_if_null_len
@_need_sorted
def median(xs):
return xs[len(xs) // 2 ]
@_none_if_null_len
@_need_sorted
def q75(xs):
return xs[3 * (len(xs) // 4)]
|