Knowledge required by ACM)

(From: http://www.ithao123.com/topic/10002.html)

For ACM CompetitionsAlgorithmI divided the class into three parts: mathematics, data structure, and algorithm.

The ACM Competition Algorithm is divided into three parts: mathematics, data structure, and algorithm.

Mathematics)

1. Discrete Mathematics)

1.1 Graph Theory)
Graph traversal: DFS, BFs
Minimum Spanning Tree: Prim, Kruskal
Shortest Path: Dijkstra, Floyd
Transitive Closure)
Articulation point-undigraph)
Topology Sorting (Topological Sort-AOV-Network)
Critical Path-AOE-network)
Loop problem: Euler path and Hamilton tour)
Difference constraints: Bellman-Ford
Artite matching)
Network Flow)
...

1.2 combinatorics)

2 Number Theory)
2.1 prime number: GCD, LCM...
2.2 Tongyu

3. Computational Geometry)
Intersection of line segments, polygon area, determination of Interior Point outer points, convex hull, Bary center )...

4 Linear Algebra
Matrix, linear equations )...

5 Probability Theory

6 elementary mathematics and analytic ry

7. Advanced Mathematics
Dot Product, cross product, integral, differential )...

Data Structure)

1 linear structure
Linear table (linear List)
Stack and queue)
Array, string, and General List)

2 Non-linear structure
Tree)
Heap)
Graph)

3. Sort

3.1 insert sorting
Insert sort O (N ^ 2)
Binary insert sort)
Shell sort)

3.2 Exchange sorting
Bubble sort O (N ^ 2)
Quick Sort )?? O (nlogn)

3.3 select sorting
Select sort O (N ^ 2)
Tournament sorting (tournament sort) O (nlogn)
Heap Sort O (nlogn)

3.4 merge sort o (nlogn)

3.5 base sorting (Radix sort) O (D (n + Radix ))

4. Search

Binary Search 4.1)

4.2 tree
Binary Search Tree)
Balanced search tree (AVL Tree)
Union-find set)

4.3 hashing)

Three algorithms (algorithm)

1. Simulation Algorithm

2 search algorithms
2.1 Enumeration)
2.2 depth first search)
2.3 breadth first search)
2.4 Heuristic Search)

3. Algorithms with "similar or identical subproblems" as the core
3.1 Recursion
3.2 recursion (recursion)
3.3 greedy)
3.4 Dynamic Planning)