What is the difficulty of data structure?

1, it is difficult to write dichotomy every time you look at it; Every time the pointer doesn't know where to point, it is difficult to reverse the linked list; What is difficult is that the implication is clear and can be matched with any KMP violence; Must be used; The difficulty is that a simple data structure like stack is so useful.

2. It's hard to tell the difference between a program that takes a lot of time but can't figure out how to use a hash table; It is difficult to recursively enter a binary tree as deep as the sea. From then on, the offer is a passer-by; Even violent search is hard to find, so backtracking algorithm must be used.

3, it is difficult to find routines in greed; The transfer equation of dynamic programming is difficult to solve; The hard part is that the idea is simple and you can't write it; The difficulty is that the learning method is not gradual.

Finally, both students and old birds who have worked for many years need to learn algorithm knowledge. After learning the algorithm well, it is easy to enter a big factory, which is very helpful for future career development.

universal algorithm

The content of data structure research is how to organize data according to a certain logical structure, and choose an appropriate storage representation method to store the data organized by logical structure in computer memory. The purpose of algorithm research is to process data more effectively and improve the efficiency of data operation. The operation of data is defined on the logical structure of data, but the concrete implementation of the operation should be carried out on the storage structure. Generally speaking, there are the following common operations:

(1) retrieval. Retrieval is to find the nodes that meet certain conditions in the data structure. Usually, given the value of a field, find the node with that field value. ?

(2) insert. Add a new node to the data structure.

(3) Delete. Removes the specified node from the data structure.

(4) update. Change the value of one or more fields of the specified node.

(5) sorting. Rearrange the nodes in the specified order. Such as increment or decrement.