-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathinteresting.txt
83 lines (46 loc) · 947 Bytes
/
interesting.txt
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
Concepts:
---------
markov chain
priority queue / bin heap
semaphores
producer consumer
clustering
triples
distant
spanning tree
trie
permute complete / unique
probability state machine
dijkstra algo
cycles detection / garbage collection
bayesian inference (spam email)
precision vs recall
compression (lzw)
hash functions
generating random numbers
normal (gaussian) distribution
central limit theorem
* sum of lots of random (iid) variables is a normal distribution
law of large numbers
outliers (strong and weak)
std dev (iqr inter-quartrile-range)
* 68% are 1 stddev from mean, 95% are 2 stddev, 99.7 are 3
expectation
sorting performance
quicksort
mergesort
bubble sort
datastructure performance
Classic Problems:
-----------------
dining philosophers
7 bridges
monty hall
Modern DS / Algos:
------------------
consistent hash
bloom filter
Scalability:
------------
sharding
large sort