2020 February 9 data structure
X hurt really busy, ready to review the data structure, after examination had lqb
1. The logical structure of the data
Linear, dendritic, structure pattern
2. The data storage structure
Order chain structure
3. The abstract data types and data type
Data types supported by high-level programming language primitive data types such as int
abstract data types in the basic data types derived from the types of stacks, queues, etc.
4. The algorithm is a method to solve the problem described steps set
The nature of the algorithm input of the output of the limited nature of certainty the enforceability of
the design goals of high robustness readability correctness time high space efficiency
The worst case time complexity of the time average time complexity (all the same)
The number of executions basic statement of
## have used just run function
rand to generate random function, if not set seed, each time a random number is the same
srand () function is used to set the algorithm seed, time (NULL) Returns the current time,
first call srand (time (NULL)) is the current time as a seed, is generated each time you run the program a different sequence of random numbers.
Due to the large epidemic, resulting in three months to allow the school, hoping to end quickly
