Embedded rookie Advanced ①---algorithm entry Foundation

1, according to the logical relationship between the data elements can be divided into 4 logical relations:

"One to one": linear structure

"One-to-many": Tree-shaped structure

"Many-to-many": graphic or mesh structure

"Belong to one set, no other relationship": pure collection structure

2, according to the storage classification in the computer:

Sequential storage: logical neighbors and physical locations are adjacent

Chained storage: Logically adjacent, no physical location required

Index storage: Data elements are stored at the same time, to establish an index table, the index table generally includes keywords and addresses and other information (the keyword uniquely identifies a data element)

Hash Store: Calculates the storage location of the data element directly from the data element's keywords. Thought: The key of a data element K as a variable, after the function of F (k), to obtain the storage address of the data element

3. Algorithm Features

Poor: A valid input value for any set of values, must be able to end after the execution of a poor step

Deterministic: The algorithm has only one execution path for each case and does not have two semantics

Feasibility: All operations of the algorithm can be implemented by a finite number of basic operation operations

Input: 0 or more inputs

Output: One or more outputs must be available

4. Algorithm evaluation

Correctness

Readability

Fault tolerance: When entering illegal data, the algorithm is able to react or process appropriately

High efficiency: Saves time and space

Embedded rookie Advanced ①---algorithm entry Foundation