Operations related to sequence table

**

For the relevant operations of the sequence table

For the relevant operations of the sequence table

**
1、 The first is the initialization of the sequence table （ static state ）

At initialization , Define the maximum length （ Like arrays , Can't expand ）, And the actual length of the current stored data , Initialization defines the actual length as 0, The subsequent insertion value is incremented ,,

improvement （ Dynamic allocation ）

If there's not enough memory , Will expand the space , Copy the original content

（ The red line points to the first data element in the sequence table ）

From the picture below （ How much space to expand ？）
Define pointer p Point to the first data location , And then use L.data Expand space , Copy the past , The maximum length of the sequence table is updated

Insert operation of sequence table ------------------

We are in the... Of the linear table i Location insert element e Return to update the linear table （&） , Thought is to move backward as a whole , take e Insert in ,

At the same time, we should also judge whether the space is full ,,, Or it is not allowed to insert more than the maximum length ！！！！！！

The deletion of the sequence table -------------------

The deletion operation is to delete the i Deduct the value of , The elements behind move forward You can see the parameters （&）
Let's take out the deleted data and wait for it to return
Deletion is the opposite of insertion It's to remove it from the front and move it forward from the back

Search operation of sequence table ------------------

The search of static memory allocation only needs to return return L.data[i-1] that will do （ Pay attention to the i Bit order , An array is data[i-1]）
（ Search by bit ）

Search by value By reference e Compare
By traversing L.data[i] and e Compare , Same return bit order
（ According to the value lookup ）