data

data element

data item

Data>Data Element>Data Item (Student Table>Personal Record>Student Number, Name...)

data object

Data structure concept

a. The logical relationship between data, also called logical structure

b. The representation of data elements and their relationships in computer memory becomes the physical structure of data or the storage structure of data.

(The storage structure is the image of the logical relationship and the image of the element itself, the logical structure is the abstraction of the data structure, and the storage structure is the implementation of the data structure)

c. Data calculation and implementation

logical structure of data

The physical structure of data (storage structure)

1) Data type

2) Abstract data type (ADT)

Data object: ＜Definition of data object＞ Data relationship: ＜Definition of data relationship＞ Basic operation: ＜Definition of basic operation＞｝ADT abstract data type name

Data object: D＝{r, : Circle (&C, r, x, y) Operation result: Construct a circle. double Area (C) Initial condition: The circle already exists. Operation result: Calculate the area. double Circumferece (C) Initial condition: The circle already exists. Operation result: Calculate the circumference. ． ． ． ｝ADT Circle

The definition format of basic operations is: a. Basic operation name (parameter list) b. Initial conditions: (description of initial conditions) c. Operation result: (operation result description)

######

algorithmic language

Algorithm time complexity

space complexity

Data elements of the same type

limited

orderly

Table length, empty table

Table header, table footer

precursor, successor

Bit order of data elements (starting from 1)

When is it necessary to quote "&"

Function naming should be readable

sizeof(ElemType)

storage structure

Implemented using "static array"

Once the size is determined, it cannot be changed

code

Implemented using "dynamic array"

L.data=(ElemType

)malloc(sizeof(ElemType) size);

When the sequence table is full, malloc can be used to dynamically expand the maximum capacity of the sequence table.

It is necessary to copy the data elements to a new storage area and use the free function to release the original area.

code

The header file using malloc and free functions is #include