What are the 10 algorithms and data structures that programmers must know? _ Algorithm

Algorithm

Figure Search (breadth first, depth first) depth priority is particularly important

Sort

Dynamic programming

Matching algorithm and network flow algorithm

Regular expressions and string matching

Data

Diagram (the tree is particularly important)

Map

Heap

Stacks/Queues

Tries | Dictionary Tree

Additional recommendation

Greedy algorithm

Probability method

Approximate algorithm

Above is the recommendation of Arjun Nayini, the following is the recommendation of Ken George

Note: There is no specific priority below

Algorithm:

Three-way division-Quick Sort

Merge sort (more extensibility, complexity similar to quick sort)

DF/BF search (to know how to use the scene)

Prim/kruskal (minimum spanning tree)

Dijkstra (Shortest path algorithm)

Selection algorithm

Data

HashMap (Really want to know all the hash structure)

Pictures and trees (red and black trees are very studious) (Red-black trees are good to learn)

Heap (priority queue)

Stack/queue (basic content that must be known)

Tries | Dictionary Tree

A * and genetic algorithms are also interesting.