This archive of acm code is implemented mainly by C++, though I like many kinds of language. The following is the code list, I will modify the list once I make any modification in the code.
Contact me if you have any problem.
ct.Liu@buaa lcndn3@gmail.com
Fundamentals
- Merge Sort
- Matrix Multipliaction
Data Structure
- AC Automaton
- Boyer Moore (substring search)
- Disjoint Set
- Hash Table
- Heap Sort
- Kmp (substring search)
- LCA (Sparse Table, online algo)
- LCA (Tarjan, offline algo)
- Rabin Karp (substring search)
- Segment Tree
- Trie
- 1-D RMQ
- 1-D Binary Indexed Tree (BIT)
Geometry
- Convex Hull
- Closest Pair
Graph Theory
- Cut Point && Bridge
- Bipartite Graph Match (Hungary Algo)
- Euler Path (Cycle)
- Max Flow (Edmonds Karp Algo)
- Minimum Cost Maximum Flow
- MST (Kruskal Algo)
- SCC (Tarjan Algo)
- SCC (Kosaraju Algo)
- Dijkstra Algo
- BellmanFord Algo
- SPFA Algo
- Topological Sorting
Number Theory
- Combination
- Euler Function
- Some Other Formula
Dynamic Programming
- Zero One Pack
- Compete Pack
Uncategorized
- Permutation
- Traversal in Tree non-recursively (levelorder, preorder, inorder and postorder)