Algorithm classification (write this is to let oneself later to learn the algorithm when there is a targeted bar rational)

Today, ACM Seniors help us summarize the following algorithms, God, I found myself have a lot of not, and some have not even heard of, but I put these down, after the good time to fill their weak part

Basic algorithm: This comparison with more, I do more than the summary of the problem, probably sort of greedy and so on.

Data structure: All say " algorithm + data structure = Program ", the data structure is more important, the dictionary tree (pointer array) (compared to and look at the dictionary tree is limited, but these are the most basic, it must be mastered), the focus is on each node modification, there are and check set , this I feel more profound, encountered a lot of problems to use and check set, but now not, really, good study, seniors said also look for a wide range of application.

Graph theory: Sub- topological sorting, and search set, the minimum spanning tree, the shortest way ... Seniors say that the three classical algorithms of graph theory must be mastered, there are Floyd algorithm (triple for loop implementation), Dijkstra algorithm (greedy), the bell-Ford algorithm (Seniors said this really does not understand the thought is OK, but I think the seniors are very good ah, they must have spent time to see, I also want to see, change as they are so strong), but I go, these I have only heard of Dijkstra algorithm, then used or understood, the words are estimated to write, and so I summed them up, good proficiency, right, he also said SPFA algorithm, SPFA ( Shortest path Faster algorithm) (queue optimization) algorithm is a single source shortest path algorithm, is derived from the Behrman Ford algorithm, high efficiency, similar to BFS, (555555~~~~~~ actually BFS I have not mastered).

Dynamic planning: This algorithm is very important, almost every race will come out with such a problem, it is important to get this algorithm, and knapsack problem is certain must be mastered. Where DFS and BFS plus memory can become DP, similar to DP but also different (just listen to the seniors, but I did not try).

Number theory: There are more things around here, if only listening to the algorithm class will be a little bit simple just, this should be their own book to learn to see. GCD and extension gcd, China remainder theorem, inverse element, prime number ... Book-Flipping studies.

Tree array and line segment tree (harder): I do not know this should be divided into which category, so separate list out, anyway, listen to seniors said this is more difficult, the study will be a long time, but still want to study drip!

Combinatorial mathematics: This knowledge is more, this is my own feeling, a lot of questions are used, but I now also smattering, a lot of things difficult to understand, especially the mother function or something to a few heavy for loop, real let my head is big. But it's really important, I think.

Search: Bfs,dfs ... and derived from the algorithm, the most basic must be mastered.

Calculate geometry:

Game:

I didn't come or listen to the latter two algorithms, so ... I can not say anything, after a good look, before I always think now do not listen to the end of the class I fill, in fact, after Class I will not touch those things, so no matter what things, can not think later, think up to do, vigorous, hey. There is a sentence how to say, now do not go, later run can not catch up with others.

In short, these days to these algorithms have a crazy interest, think very interesting, Scarlett said I try harder, maybe, she did not know, I just this time have interest, no matter what, as long as I have interest, will go crazy to do, regardless of other things, if it is to let me feel boring things, I can't do it well.

This period of time very believe a word, now life is their own choice, we choose and be chosen to live. Yes, this moment, in fact, is your choice, everyone with their own choice of life in this world, choose now life I have no regrets, no regrets, everything is my choice! I love it.

Algorithm classification (write this is to let oneself later to learn the algorithm when there is a targeted bar rational)