-
I would like to introduce you to Yan Weimin's textbook "Data Structure" (C language version), which is currently a classic textbook with a good reputation in China.
Data structures emphasize logical ideas rather than languages, C C++ language is the form, and data structures are the soul.
-
Read the book, read the source code, write by hand,
-
Hum. It's really hard to learn this.
It took three years to learn computer science.
Software is a program + data structure.
Now it feels like the program is okay. It's just that the data structure is difficult to grasp.
And the data structure is the soul. If you don't know how to structure data, you don't know how to program.
Visible importance of data structure.
I'm also looking for a way to learn about data structures.
Brother. We are all from the end of the world.
-
When I was studying, the data structure felt difficult.
But you can understand the textbook by reading it several times.
c C++ foundation is not important for data structure relationships.
As long as you can understand it.
The main thing is to learn the mind.
Read the book several times.
Also, share the experiences of others
First of all, you have to learn the C language, especially pointers, functions, and structs
Then I think first of all, don't pay too much attention to the implementation of the data structure in C.
The first step is to read the book first, omitting the specific description of the C language in it, that is, not reading these first. Don't look at those calculation formulas, just figure out the concepts inside, such as linear tables, first you only need to figure out what a linear table is, and it is best to give yourself an outline, for example, linear structure-tree structure-diagram structure, and then subdivide, understand all the concepts.
The second step, when reading the book for the second time, carefully look at the definition statements of those structures, and what are the basic algorithms for each structure, and how to implement them in C.
The third step is to look at some formulas at the end, such as time complexity, and so on. Of course, this requires a foundation in advanced mathematics.
The fourth step is to try to use some data structures that you have mastered to describe in C language, and find some examples to do, that is, to practice. Finally, if you are still interested, you can take a deeper look at some basic algorithms in software engineering.
I'm sure you'll learn how to structure data
-
Summary. Hello, glad to answer for you. Kissing, Data Structuring; 1.I think there are three parts to getting started with algorithms and data structures: 2Choose a suitable book. 3.Programming, implementation, and application.
Hello, glad to answer for you. Kissing, Data Structuring; 1.I think there are three parts to getting started with algorithms and data structures: 2Choose a suitable book. 3.Programming, implementation, and application.
Methods of self-learning of data structures: firstly, the first stage is to understand the data structure, understand the basic composition and performance; Then the second stage is to go deep into the data structure, master the relevant characteristics, and be able to write**; Finally, in the third stage, the data structure is retrieved and the knowledge points learned are applied to practical problems.
1. Common data structures: linked lists, trees (such as binary trees). 2. Common algorithm ideas:
Greed method, partition method, exhaustive method, dynamic programming, retrospective method. The above list is the most basic. That is to say, before you brush the questions, you have to go through these questions again and again.
Just o(n) scans it once, millions of arrays are not big, and c can be opened so big for global variables. >>>More
The algorithm is similar, but the language description is different, C is the basic! However, the C++ language is relatively simple, so it's good to get used to which one!! The data structure is mostly used in C++, it depends on which version of the textbook you use, if you learn C++, then use the C++ version of the textbook, the problem is not very big!! >>>More
The Huffman tree is:
The weighted path length of a tree is the sum of the weighted path lengths of all leaf nodes in the tree, and the weighted path length of a node is the product of the path length from the node to the root node and the weights on the node. >>>More
Since China Unicom's WCDMA 3G network is not yet perfect, you should turn off the 3G and cellular data settings, and you can only play ** but the call quality is the best. iPhone4 won't show up"3g"or"e"。 >>>More
When changes to data affect the index, the information in the index can be spread out across the database. Reindexing reorganizes the storage of indexed data (and in the case of clustered indexes, table data) and defragments it. This improves disk performance by reducing the number of page reads required to obtain the requested data. >>>More