-
I have the same issue.
-
Recommend the textbook "Data Structures" (C language version) (Tsinghua University Press, edited by Yan Weimin and Wu Weimin).
Chapter 1 of Tsinghua University Computer Science Textbook: Data Structures (C Edition) provides an overview of the basic concepts of data, data structures, and abstract data types. Chapters 2 to 7 discuss basic types of data structures and their applications from the perspective of abstract data types, such as linear tables, stacks, queues, strings, arrays, generalized tables, trees and binary trees, and graphs.
Chapter 8 provides a comprehensive overview of the basic techniques of dynamic storage management involved in operating systems and compilers.
Chapters 9 to 11 discuss search and sequencing, focusing on qualitative or quantitative analysis and comparison over time, in addition to various implementation methods. Chapter 12 describes common file structures.
This book can be used as an undergraduate or junior college textbook for computer science majors or information-related majors.
A data structure is the way a computer stores and organizes data. A data structure is a collection of data elements that have one or more specific relationships with each other. Often, a well-chosen data structure can lead to higher operational or storage efficiency.
Data structures are often associated with efficient retrieval algorithms and indexing techniques.
-
Talk about how to learn data structures:
1.If you haven't studied C, or if you don't learn C well and you learn data structures as if they were a math book, it's all about simple graph theory. The main thread in your brain can't be lost:
Linear structure, tree structure and graph structure. When you stop thinking about complex programming and just study the relationship between discrete points, it seems that the data structure is not so difficult.
2.After learning the abstract discrete point relationships, and then consolidate your C language level, the book describes the class C. Therefore, as long as you learn simple C definitions, judgments, and loop statements, you can basically understand all the programs in the textbook.
3.Once you've done all of the above, start with a linear table of data structures. Sequential tables in linear tables seem to be designed for you to learn the C language, and learning the linked list of linear tables is the key to getting you started.
The chain structure is indispensable for the tree structure, graph structure, sorting, and searching, and this is often the most difficult.
4.When looking at the program, you must draw on paper by yourself, and it is best to learn to draw the flowchart of the program first, maybe then you will learn the program faster.
5.Data structures are the most basic and useful part of programming, and you will benefit a lot after learning it, and maybe this book can determine your future path or destiny.
A hash table (also known as a hash table) is a data structure that is directly accessed based on the key value. That is, it accesses records by mapping key values to a location in the table to speed up lookups. This mapping function is called a hash function, and the array that holds the records is called a hash table. >>>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
Just o(n) scans it once, millions of arrays are not big, and c can be opened so big for global variables. >>>More
A data structure is the way a computer stores and organizes data. A data structure is a collection of data elements that have one or more specific relationships with each other. Often, a well-chosen data structure can lead to higher operational or storage efficiency. >>>More
It's all been returned to the teacher.