Parallel Algorithm (zero) Order

This semester I chose an algorithm course (CS2510), and the people who made it were dead because there were so many jobs that XX people had never been interrupted three times a week, and it was very difficult .... At the same time, our teacher is said to be an important person in the North American algorithm field. The class is fast and requires no PPT, no manuscript, a pen, and a brush on the blackboard. In addition, I often cannot keep up with the English language... Resentment...

But I still learned a lot, basically covering all the content in the introduction to algorithms. Benefits. Prepare to introduce some basic algorithm knowledge. At the same time, the right should be reviewed by yourself.

I want to name this series and think for a long time. I think that the word "talking" should reflect the essence of something I want to write.

It means nothing, because it may need to cover many sub areas in the algorithm.

At the same time, there are also some casual meanings. I think where to write, the language may be easygoing, and the style of the Articles on Science Network is different.

At the same time, the most important thing is that the algorithm mentioned here is actually focused on algorithm analysis. mathematical analysis is not written for preparing for the interview. This article focuses on the overview of algorithm as an important research direction in computer science. The involved aspects may be broad.

First, simply give a directory and try to stick to it.

I. Greedy Algorithm (Greedy Algorithm)

II. Dynamic Programming)

3. NP-Complete problem

4. Divide and Conquer)

5. Problem Complexity analysis (Problem Complexity and Adversarial Lower Bound)

Sat. Average case analysis and randomized algorithm)

7. Graph (Graph Algorithm)

8. Linear Programming)

9. Approximation Algorithm)

10. Online Algorithm (I don't know how to translate it, translate)

Liu zitao