Briefly describe the characteristics of sequential table and linked list storage mode.

Sequential table: the storage space is continuous, usually realized by arrays. So you can search by index, which has the advantage of fast search and modification. However, due to sequential storage, its disadvantage is that adding and deleting data to be moved is both troublesome and slow.

Linked list: the storage space is discontinuous, and each element is connected by a pointer, which is just the opposite of unordered linked list. Searching takes a long time, but adding and deleting elements is faster and can be completed in a constant time.