28 lines
353 B
Markdown
28 lines
353 B
Markdown
|
|
##
|
|
|
|
**binary search**
|
|
|
|
**union-find sets**
|
|
|
|
**topological sorting**
|
|
|
|
**knuth-morris-pratt**
|
|
|
|
**dijsktra**
|
|
|
|
**bipartite graph**
|
|
|
|
**mathematical method**: quickpow, prime judging, greatest common divisor
|
|
|
|
**binary indexed tree**
|
|
|
|
**minimum spanning tree**: krukal / prime
|
|
|
|
**segment tree**
|
|
|
|
**binary search tree & AVL tree**
|
|
|
|
**trie tree**
|
|
|
|
**k-d tree** |