"The linked storage structure of linear tables is better than the sequential storage structure" is wrong. Each has its own advantages and disadvantages, and cannot be generalized. If the number of elements is known and there are few insertions and deletions, a sequential structure can be used; but for frequent insertions and deletions and the number of elements is unknown, it is best to use a chain structure; programming can be designed based on the characteristics of the data to be processed. data structure.
#The linked storage structure of linear tables is better than the sequential storage structure.
A. Correct
B. Wrong
The answer is: B
The specific explanation is:
Sequential storage requires opening up a fixed-length space, which has fast reading and writing speeds. The disadvantage is that the capacity cannot be expanded (if you want to expand, you need to open up a new space large enough to rewrite the original data)
Chain storage does not need to worry about capacity issues. The read and write speed is relatively slow. Since the address of the next data needs to be stored, it requires larger storage space than sequential storage.
To sum up, if the number of elements is known and there are few insertions and deletions, you can use the sequential structure. For frequent insertion and deletion operations, the number of elements is unknown. It is best to use a chain structure. When programming, the data structure can be designed based on the characteristics of the data to be processed.
For more related knowledge, please visit: PHP Chinese website!
The above is the detailed content of Is the linked storage structure of a linear list better than the sequential storage structure?. For more information, please follow other related articles on the PHP Chinese website!