Python sequence table

Python sequence table

Learn a bit, data structure and algorithm, do a summary. If it's not right there, please give me more advice.

Sequential tables , in which elements are stored sequentially in a contiguous storage area, the order relationships between elements are naturally represented by their order of storage.

A linked list that stores elements in a series of storage blocks constructed from links.

The C in B is no longer the size of the data element, but the amount of storage required to store a link address, which is usually very small.

List and tuple two types in Python using sequential table implementation techniques

Added element 1 to the end of the element, the time complexity is O (1) 2 Non-guaranteed addition element (uncommon), time complexity of O (1) 3 Order of elements added, time complexity O (n)

Delete element 1. Delete the footer element with a time complexity of O (1) 2. non-preserving element deletion (uncommon), time complexity is O (1) 3. isotonic element Deletion, time complexity O (n)

Python sequence table