Basic Concepts a second linear table (a) the linear form

Definition of the linear form

Linear table having the same data type (n (n = 0) \ ) \ finite sequence of data elements, where \ (n-\) is a long table, when the \ (n = 0 \) when the linear list is an empty table . If using \ (L \) named linear form, it is generally expressed as:

\[L=(a_1, a_2, \cdots, a_i, a_{i+1}, \cdots, a_n)\]

Features of the linear form

1. The same data type of each data item
2. Have the order, and the bit sequence from the beginning
3. Limited capacity of the data item

The basic operation of the linear form

★ basic operation of the linear form:

1. Initialization table
2. destroy
3. insert
4. delete
5. Find by value
6. Find by location
7. Seeking long table
8. Output of all the elements
9. Sentenced empty

Tip: record sales, CRUD

Linear table storage structure

Linear table storage structure comprises: sequentially storing, linked storage.

Appreciated: different storage structures, data structures embodied on the computer is different.

The storage structure is divided into:

1. Sequence table , with the table refers to a linear sequence of memory structures to achieve;
2. Chain , refers to a linear chain with a stored table to achieve.

Also divided into:

1. Table static array with sequential implementation, called static order table
2. With the order table without head node implementation of dynamic arrays is called without head dynamic sequence table
3. Lead sequence table with a dynamic array node implementation, called lead dynamic sequence table
4. The one-way linked list node implemented with a single pointer, called single-chain
5. The one-way linked list of nodes implemented with the double pointer, called double-linked list
6. Doubly linked list with pointers to the node with a single implementation, called cycle chain single
7. Bidirectional linked list node implemented with the double pointer, called circular doubly linked list