Interview review key algorithm data structure [Shan ke Da Niu Chen Lei sorting]

Algorithm and Data Structure
I. Algorithms

1. What are the features of an algorithm.

2. Definition of algorithm complexity. Large O, θ, cosine, and small

3. The definition of recursive algorithms and the two elements of recursive algorithms.

4. The idea of the divide and conquer algorithm, classic divide and conquer algorithm

5. What are the two elements of the dynamic planning algorithm? What is the memorandum method?

6. Typical Dynamic Programming Problems (matrix concatenation problem, Longest Common subsequence problem, and 0-1 backpack problem ).

7. The idea of greedy algorithms is two elements of greedy algorithms.

8. Typical greedy problems (activity arrangement problems, knapsack problems, loading problems, Harman coding, single-source shortest path, and minimal spanning tree problems ).

9. The idea of the Backtracking Method. Which two typical models are available in the backtracking method.

10. Classic backtracking algorithms (problems after n, problems with 0-1 backpacks, and problems with travel sellers ).

11. What are the two branch Restriction Methods.

12. Classic branch restriction algorithm (0-1 backpack problem, travel vending problem ).

Ii. Data Structure

1. data structure definition.

2. Two applications of Stack: parentheses matching and expression calculation. How is it applied? Which expression is used for expression calculation? What are the benefits?

3. string matching algorithms: simple matching algorithms ,.

4.

, Heap creation algorithm, and heap insertion and deletion algorithm ,.

. What are the types of hash functions? How can I obtain the remainder? How to handle conflicts? What are the methods for closing the hash?

7. Search, insert, and delete binary search trees. Time complexity.

Which rotation methods are available? Which of the following conditions is applicable. Analyze the time complexity of the binary balancing tree.

9. Definition of the red/black tree ,.

10. Storage representation of the graph.

11. insert and sort the linked list, and merge and sort the linked list.

13. Which of the following types of common assignment sorting are available? The definition, classification, and principle of base sorting.

14. B