This page is located in archive.

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,

Text processing trees



Suffix trie
binary trie
radix trie

‘Radix tree’ = ‘radix trie’ = ‘patricia trie’: compressed trie, every internal node has at least two leaves.

Pattern Matching

More trees

Segment tree (geometry)


To implement

cycle detection ( hare and tortoise )

maximum matching in bipartite graphs (weighted and unweighted)

maximum flow (Ford-Fulkerson, Dinic )

convex hull

sweep line

Even more?

Huffman coding (static and dynamic )

Minimax, Alpha-beta pruning

Google Page rank

Other sources


courses/acm_all/2017_ls/links.txt · Last modified: 2018/10/03 03:51 (external edit)