Trajectory of algorithm Learning

Someone on the Internet said,AlgorithmThe learning method is as follows:

For beginners of programming, You can first use a simple Sorting Algorithm to understand the common operations of the simplest ADT linear table, and then master the recursive technology, including recursive and recursive mutual conversion. Recursive technology is very important. We can use recursive technology to understand the operation of the ADT stack. Then we will learn the initial method of search-backtracking to study the eight queens Problem of classical problems and the problem of the maze, through these classic problems, you can understand the depth-first search (DFS), width-first search (BFS), ADT stack, and ADT queue operations. You must learn to manually set the stack to simulate recursion; then we can learn the commonly used methods of divide and conquer and greedy, and apply them to simple algorithms such as sorting and searching; at this time, it is no longer difficult to learn the two abstract data types of graphs and trees. When learning ADT graphs and ADT trees, you must combine the graph theory knowledge in discrete mathematics with the DFS and BFS methods in the search method, and learn to convert actual problems into graph theory models; next, you can learn optimization algorithms for various search methods, such as heuristic search, algorithm A, algorithm a *, or boundary pruning. Then, you need to pay attention to the establishment of the model for the network flow algorithm; finally, I learned the solution to the optimization problem, including linear planning, dynamic planning, non-linear planning and other algorithm strategies. This part mainly focuses on modeling and analysis, and the algorithm itself is not difficult. In this way, the basic algorithm is finished. Further, you can learn about the computing complexity, computing models, parallel algorithms, neural networks, and Algorithms in various fields.

Reference from: http://xinzhongqingxi.blog.hexun.com/6538659_d.html