Data structure Overview:
Definition:
How do we store a large number of complex problems in reality with specific data types and specific storage structures into main memory,
And perform operations on top of that to perform functions such as finding an element, deleting an element, sorting all elements,
The corresponding operation is also called an algorithm
Data structure = individual + individual relationship
Algorithm = Operations on stored data
Algorithm:
Methods and steps of solving problems
Criteria for measuring algorithms:
1. Time complexity: Approximate number of times to execute, not time (most important)
2. Space complexity: the maximum memory occupied during the execution of the algorithm (most important)
3. Difficulty
4. The robustness
The status of data structures: Data structures are the core of software
Program = storage of data + manipulation of data + language that can be executed by a computer
Preliminary knowledge:
Pointer:
Pointers are important: Pointers are the soul of C
Definition:
Address: memory cell number, non-negative integer starting from 0, range: 0-ffffFFFF [0-4G-1]
Pointer:
A pointer is an address, and an address is a pointer
A pointer variable is a variable that holds the address of a memory location
The essence of a pointer is a non-negative integer with limited operation