-
Notifications
You must be signed in to change notification settings - Fork 5
/
kodlib.txt
91 lines (80 loc) · 1.6 KB
/
kodlib.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
83
84
85
86
87
88
89
90
91
dokumentation
TeX
översiktssida
algoritmer
+status
implementation
testinläs
testfall
test-valladolid, problemnummer
1. data struct - stl, trie?
graf
k-d träd
string!
2. numerical
linear eqn
bandwidth reduction? (np)
matrismult
determinant terminant
linjär programmering - simplex (?)
slumptal!
factoring, primtals, de första primtalen
bigint - flera implementationer
knapsack - dynamisk
dft ((?))
3. kombinatoriska
sortering - stl, komparatorer
transform
söka - binary_search, find, ...
one-sided bin search
median, selection, nth-element
generating permutations
all, random, next, random_shuffle
generating subsets
värt att kolla, för stl-set
generating partitions
5=1+4=1+1+3=...
generating graphs (?)
calendrical calculations
job scheduling
4. graf - polynomiska
connected - components
toposort
mst - prim, krusk
shortest path, all, girth
closure, reduction
bipartit, matching
euler/chinese postman
edge, vertex connectivity
network flow
planarity detection
5. graf - hård
. .
6. computational geom
robust geometric prim.
tri, in-circle med determinant
hölje
triangulation
voronoi
nearest neighbour
range search?
intersection
7. set and string
set cover, packing
string match string.find()
approx
text compr
cryptogrography
longest common subseq
shortest common superstring
- svåra problem
- idiom
- i/o - idiom
tidsutmatning
utskrift med viss precision med cout
fylle-rutin (fill)
uttrycksevaluering - parsing
tidtabell-sökning - search/ad hoc
n väljer k-rutin, bigmod, gcd, lcm -
newton-raphs
SPELTEORI!!!