# Summary of common/frequent test algorithms

Source: Internet
Author: User

 Transfer from TANGJZ Blog ... Basic algorithmSimulationSearch Breadth First search (BFS) Optimization: two-way BFS Depth-First search (DFS) Optimization: Binary DFS Iterative deepening Search (IDS) Heuristic Search (Astar) Optimization: Idastar Optimization: pruning, bitwise arithmetic Sort Bubble sort/Select sort Cardinal Sort/Bucket sort Count sort Insert Sort/Hill Sort Quick Sort Merge sort/Find inverse logarithm Heap Sort GreedyDivide and conquer Split/three Min/n CDQ Divided treatment Multiply/stDiscretization ofTwo-point answerFast Power/decimal fast PowerBasic mathematicsSum of seriesTaylor unfoldMatrix Matrix multiplication Gaussian elimination element Judging linear correlation Number of CatalanCombinatorial mathematics Addition principle/multiplication principle Combined number recursion/Yang Hui triangle Two-term theorem Drawer principle/pigeon cage principle Lucas theorem Principle of tolerance and repulsion Arithmetical/miller-rabin test of prime number determinationDecomposition factorization/ask for approximateEuclidean algorithm/Euclidean methodExtended Euclidean algorithm/multiplicative inverse/Two-element one-time congruence equationLinear preprocessing 1-n multiplication inverse elementPrime sieve Eratosthenes Sieve Euler sieve Euler functionsMöbius functionFermat theoremWilson's theoremChinese remainder theorem/grandson theoremTwo times remaining/cipolla ' s algorithmOriginal rootDiscrete logarithm/baby-step giant-stepGroup theoryReplacementBurnside lemmaPolya theoremDynamic planningBackpack DP 01 Backpack Full backpack Multiple backpack Mixed backpack Two-dimensional backpack Group Backpack Tree-shaped backpack Generic backpack by dimension Linear DP Interval DP High-dimensional DP By type Divide DP Longest ascending subsequence (LIS) Longest common sub-sequence (LCS) DP on a directed acyclic graph (DAG) (Connectivity-based) state compression DP Optimization Scrolling array Prefixes and Quadrilateral inequalities Slope optimization Bit arithmetic Data CDQ Divided treatment Skills Memory Search Shun Push/Reverse push Minimal notation Graph theoryConnectivity of The traversal of graphs Topological sorting Strong Unicom Component /tarjan algorithm of Cutting point, bridge and double-link component Tree Recent public ancestor (LCA)/tarjan algorithm The Center/diameter of the tree The center of the tree Isomorphism of Trees Shortest circuit Multi-source Shortest path (APSP)/floyd Minimum ring Transitive closures Single Source Shortest path (SSSP)/queue+bellman-ford/heap+dijkstra Spanning tree Minimum spanning tree Minimum scale spanning tree Minimum bottleneck tree Two-part diagram Two-part diagram verification Two-part graph dyeing Max match/Hungarian algorithm Optimal matching/km algorithm Network flow Dinic algorithm ISAP algorithm Pre-flow propulsion algorithm Tip: Break a point Optimization: Close/close Edge Optimization: Line segment Tree DataHigh precision High precision subtraction for low precision High precision subtraction for high precision Optimization: Fast Fourier transform Linked list Single doubly linked list Block Linked list adjacency Table/Benzi StackQueue Loop queue Priority queue/Minimum binary heap Left-leaning tree Fibonacci Heap Tree Binary search Tree Heap (IBID.) Flute Karlshu Tree-like array Segment Tree Expansion: Dynamic segment tree, four-point tree Weight Balance Tree Stretching tree and check SetHash table (hash)Self-MotiveString Trie Tree Kmp Manacher AC Automaton (Aho-corasick automaton) Suffix array/suffix tree/suffix automaton/suffix balance tree, etc. Dynamic tree Tree chain split/tree block split Link-cut Tree/euler-tour Tree Calculate geometryPlane geometry/geometric/analytic geometry/parametric equationsDetermining point-to-polygon relationship (corner method/Scan line method)Polygon Area intersection/area andPolar sortConvex hull/Rotating jamSemi-planar CrossTriangulation of/voronoi diagramGame theorySG Combo Game/sg functionBash games/wythoff Games/nim GamesFight SearchProbability theoryFull probabilityBayes theoremMarkov processChebyshev theoremMiscellaneousChunkingRandom adjustment/Simulated annealing/random mountain climbingSimplex method

Summary of common/frequent test algorithms

Related Keywords:

### Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

## A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

• #### Sales Support

1 on 1 presale consultation

• #### After-Sales Support

24/7 Technical Support 6 Free Tickets per Quarter Faster Response

• Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.