[C Language] Data Structure overview, C Language Data Structure Overview
1. Data Structure Overview
Definition
How can we store a large number of complex problems in reality in a specific data type and a specific storage structure to the primary storage (memory,
And the corresponding operations to implement a function (such as searching, deleting, searching, and sorting all elements ).
This operation is also called an algorithm.
Data Structure = individual + individual relationship
Algorithm = operations on data storage
Prerequisites
2. Module 1: Linear Structure
Continuous storage [array] (for students in the class)
Discrete storage [linked list] (all students in the University)
Stack, one of the common applications
Common application second queue
Topic: Recursion
Sum of 1.1 + 2 + 3 + 4 + 5 +... 100
2. factorial
3. Linglong
4. Walk through the maze
3. Module 2: Nonlinear Structure
Tree (storing personnel and organizational relationships)
Figure (map of traffic associated with multiple sites)
4. Module 3: search and sort
Half Lookup
Sort:
Bubble
Insert
Select
Fast
Merge
5. Knowledge about containers and data structures in java
Iterator Interface
Map
Hash table