What are the five features of C language algorithms?

First, 3 linklist types list, p, and r. are declaredYou can think of list as a table, but at the beginning it is an empty table, list is assigned to r, start a for loop, specify the next node of r as p (head node), and then assign p to r, the next node of the head node is list, list is assigned to p, enter a from the keyboard, if a > 0, then the data part of the second node is the value of a, and the cycle continues, and the condition for the end is to enter the value a>=0, when p is sure to reach the last node after the while loop ends, p is assigned to r, r is the end node, and then output with do while, output the data of each node, and the end condition is p to the end node. To put it bluntly, first create an empty table k-1 node, then input the keyboard to assign the value of the data part of each node to "0", and finally output the input value.

void printele(int k)

linkklist list, p,r;

int i,a;

list=(linklist)malloc(sizeof(lnode));Create a head node.

r=list;

for(i=1;ilink=p;

r=p;r->link=list;Assign the address of the head node to the end node, indicating that it is a single-cycle linked list, with the head and tail connected.

p=list;

while(scanf("%d",&a)>0){ Iterate through the linked list and enter the data.

p->data=a;

p=p->link;

r=p;do{

printf(“%d”,p->data);Traverse the linked list and print the data.

p=p->link;

while(p!=r);

1. Exhaustive: An algorithm must be guaranteed to end after a finite number of steps;

2. Certainty: Each step of the algorithm must be precisely defined;

3. Input: An algorithm has 0 or more inputs to describe the initial situation of the operation object, and the so-called 0 inputs mean that the algorithm itself determines the initial conditions;

4. Output: An algorithm has one or more outputs to reflect the results of processing the input data. An algorithm without output is pointless;

5. Feasibility: In principle, the algorithm can be run accurately, and people can complete it after doing a limited number of operations with pen and paper.

An algorithm in C refers to a definite and finite number of steps taken to solve a particular problem, and the five main characteristics are: infinite, deterministic, feasibility, having 0 or more inputs, and having one or more outputs.

An algorithm refers to a definite and limited number of steps taken to solve a particular problem.

An algorithm should contain a finite number of operational steps;

Each instruction in the algorithm must have a precise meaning, no ambiguity, and the same execution result must be obtained for the same input;

The operations specified in the algorithm can be implemented by performing a limited number of basic operations that have been verified to be achievable.

Algorithms implemented on computers are used to process data objects, which in most cases need to be obtained by input;

The purpose of the algorithm is to solve, and these solutions can only be obtained through the output (note: the algorithm must have more than one output).

Five important features of the algorithm:

1.Impoverished: What you want to do cannot be done indefinitely. (Trending towards zero is not equal to zero).

2.Deterministic: The structure made in this way is deterministic under the same state or initial conditions.

3.Feasibility: The solution of a problem is divided into several steps, each of which is feasible.

4.Input.

5.Output.