Efficient (primary algorithm) outline

First, the algorithm analysis preliminary

1. Progressive time complexity

2. Upper bound

3. Division and Treatment

4. Correct treatment of algorithm analysis results

Second, re-talk about sorting and retrieval

1. Merge sort

2. Quick Sort

3, two-point search

Iii. recursion and divide-and-conquer

Four, greedy

1. Backpack

2. Interval

3, Huffman code

Five, algorithm design method

1. Construction method

2. Midway Meeting Method

3, problem decomposition

4. Equivalent conversion

5. Scanning method

6. Sliding window

7. Using Data structure

8. Combination of several shapes

Efficient (primary algorithm) outline