Search
Zájemcům mohu zapůjčit/dodat v elektronické podobě:
[Sedgewick] Algorithms in C++, Parts 1–4: Fundamentals, Data Structure, Sorting, Searching, Third Edition
[CLRS] T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to Algorithms, 3rd ed., MIT Press, 2009,
2.3.
16.3.
‘Radix tree’ = ‘radix trie’ = ‘patricia trie’: compressed trie, every internal node has at least two leaves.
Aho-Corasick
Knuth-Morris-Pratt
Boyer-Moore
Rabin-Karp
Finite automata (many variants)
Segment tree (geometry)
Treap
cycle detection ( hare and tortoise )
maximum matching in bipartite graphs (weighted and unweighted)
maximum flow (Ford-Fulkerson, Dinic )
convex hull
sweep line
Huffman coding (static and dynamic )
Minimax, Alpha-beta pruning
Google Page rank
Other sources
http://cseweb.ucsd.edu/~kube/cls/100/lectures.html