How do you build a sequential linear table? Take a data structure approach

Linear tablesThe chained storage structure is a sequential storage structure.

Each storage node in the chain storage structure of a linear table contains not only a data element, but also a pointer, and each pointer points to a node that has a logical relationship with the node, and this storage mode belongs to sequential storage. Linear tables are the most basic, simplest, and most commonly used type of data structure.

A linear list is a type of data structure, and a linear table is a finite sequence of n data elements with the same characteristics.

Brief introduction. When we say "linear" and "nonlinear", we only discuss it at the logical level, without considering the storage level, so biacutely linked lists.

and circular linked lists are still linear.

Subdivided at the logical level of data structure, linear tables can be divided into general linear tables and restricted linear tables. Generally, linear tables are what we usually call "linear tables", and nodes can be deleted or added freely. Restricted linear tables mainly include stacks and queues, and restricted means that the operation on nodes is restricted.

The sequential storage of a linear table refers to the sequential storage of each element in the linear table in sequence with a set of consecutive address storage units, so that the data elements adjacent to the logical structure in the linear table are stored in the adjacent physical storage units, that is, the logical adjacency between the data elements is reflected through the adjacency of the physical storage of the data elements, and the linear table with the sequential storage structure is usually called the sequential table. A sequential table is a storage unit in which the nodes in the table are stored sequentially in a set of contiguous addresses in the memory of the computer.

The sequential structure of storing the elements in a table one after the other into a set of contiguous storage cells. Linear tables with a sequential storage structure are referred to as "sequential tables". The storage characteristics of sequential tables are as follows:

As long as the starting position is determined, the address of any element in the table is obtained by the following formula: loc(ai)=loc(a1)+(i-1)*l 1 i n where l is the length of the storage cell occupied by the element.

The sequential storage structure of a linear table represents the logical relationships between data elements in terms of their relative physical positions.

Answer]: The sequential search method is suitable for linear tables (regardless of whether linear tables are stored sequentially or chained). The hash storage is directly searched according to the hash function value.

Compressed storage is searched by correspondence. Index storage is to accompany the index table to search.

Sequential table. Definition of a sequential table.

Sequential storage method.

That is, the nodes of a linear table are stored in a logical order in a set of storage cells with contiguous addresses.

Sequential list

A linear table stored using the sequential storage method is referred to as a sequential list

The storage address of node a i.

If all nodes in the linear table are of the same type, then the amount of storage space occupied by each node is also the same.

The storage address of the meta is the storage address of the node, and if the storage address of the starting node A in the table (referred to as the base address) is loc(a), then the storage address of node A i is loc(A i

It can be calculated by the following formula.

loc(a i )=loc(a )+i )*c ≤i≤n

Note that in a sequential table, the storage address of each node a i is a linear function of the position i of the node in the table, and any node can be found in the same amount of time as long as the base address and the size of each node are known.

A point's storage address is a random access structure.

Sequential table type definition.

define listsize The size of the tablespace can be determined according to the actual needs, which is assumed here.

typedef int datatype;The type of datatype can be determined according to the actual situation, and it is assumed to be int here

typedef struct {

datatype data[listsize];Vector data is used to store table nodes.

int length;The current table length.

seqlist;

Note: In addition to storing the elements of a linear table, the sequential table should also use a variable to represent the length property of the linear table, so the structure type is used to define the ordinal table class.

The size of the vector space where linear table nodes are stored should be carefully selected so that it can not only meet the needs of the dynamic increase of the number of table nodes, but also avoid wasting storage by pre-defining too large.

Space Since the subscript of vectors in C starts with , if l is a seqlist sequential table, then the start node a and the terminal node a n of the linear table are stored in l data[ ] and , respectively.

l data[l length].

If l is a pointer variable of type seqlist, then a and a n are stored in l >data[ ] and l >data[l >length], respectively.

Features of sequential tables.

A sequential table is a linear table implemented with a vector, and the subscript of a vector can be regarded as the relative address of the node, so the characteristic of the sequential table is that the nodes that are logically adjacent are also physically adjacent to each other.

lishixinzhi/article/program/sjjg/201311/23372

The sequential storage of a linear table is the simplest and most direct storage structure of a linear table, and it is a continuous storage space with an address in memory, and each element of the linear table is stored in order The linear table stored in this form of storage is called a sequential table, and the linear relationship between the addresses in the memory is used to represent the relationship between the data elements in the linear table This kind of logical adjacency between data elements with physical adjacency is simple and clear As shown in the figure, let the storage address of e be loc(e) Each data element occupies d bytes of storage unit, then the address of the ith data element is .

loc(ei)=loc(e)+i )*d i n, which means that as long as you know the address at the head of the sequential table and the number of address units occupied by each data element, you can find the address of the ith data element. Therefore, the sequential storage structure of linear tables is a kind of random access storage structure, which has the characteristics of random access according to the serial number of data elements.

Linear table Memory representation of a sequential table.

Subscript Data Element.

Storage address Storage element e

The sequential table is characterized by the use of physical adjacency to express the logical precursor and successor relationship, which requires the sequential storage of each element in the linear table with continuous storage units, and the logical adjacency of the linear table needs to be realized by moving the sum and collapsing the data elements when inserting and deleting the sequential table, so as to affect its operation efficiency.

The storage characteristic of the sequential table is to express the logical precursor and successor relationship by using the physical adjacency, which requires the sequential storage of each element in the linear table with continuous storage units.

2.When sequential tables are inserted and deleted, the logical adjacency of linear tables needs to be achieved by moving data elements, which affects their running efficiency. This section describes another form of storage for linear staking, the chain storage structure.

3.The two logically adjacent data elements are also adjacent in the physical structure, and there is no need to move the elements when inserting and deleting, so as to improve their operation efficiency, and the chain storage structure mainly includes several forms such as single linked list, circular linked list, bidirectional linked list, static linked list, etc.

4.A linked list is a set of arbitrary storage units (which can be continuous or discontinuous) to store the data elements in a linear table, and according to the logical definition of a linear table, the storage unit of a single-linked list can store more than just the elements.

5.The first node of the linked list is preceded by an additional node called the "head node", which will bring convenience to the operation of the single linked list, of course, the user can also store some information related to the entire single linked list in the data field of the additional node.

The storage unit address is continuous, and it represents the logical relationship between the data elements in the linear table as "physical location adjacent", and any element in the table can be accessed randomly.

Sequential table is a linear table stored in the form of an array in computer memory, and the sequential storage of a linear table refers to the sequential storage of each element in the linear table with a set of consecutive addresses, so that the adjacent data elements in the logical structure of the linear table are stored in the adjacent physical storage unit.

Linear table structure features

1. Uniformity, although the data elements of different data tables can be various, each data element of the same linear table must have the same data type and length.

2. Orderliness, the position of each data element in the table only depends on their serial number, and the relative position of the data element before is linear, that is, there is a unique "first" and "last" data element, except for the first and the last, there is only one data element in front of the other elements (direct precursor) and only one data element (direct successor) in front of the other elements.