What are the important features of the algorithm?

There are five important characteristics of algorithms: certainty, feasibility, input, output, and finiteness.

Algorithms are the ones that solve the "what" and "how" questions. There may be many different algorithms to solve a problem, and in terms of efficiency, the core of which is the speed of the algorithm. Therefore, the steps to solve the problem need to be completed within a limited time, and there should be no ambiguity in the operation steps to prevent subsequent steps from proceeding.

Through the analysis of the concept of the algorithm, it can be concluded that an algorithm must meet the following five characteristics.

1) Impoverished. An algorithm that can be implemented in a limited time after performing a finite number of steps is said to be infinite.

Some algorithms are theoretically exhaustive and can be completed in a limited number of steps, but a computer may actually perform it for a day, a year, a decade, and so on. The core of the algorithm is speed, so this algorithm is meaningless. In short, there is no specific limit to poverty, it depends on people's needs.

2) Certainty. The formulation of each step in the algorithm should be a definite and unambiguous statement. In people's daily life, when encountering ambiguous sentences, they can be understood according to common sense, context, etc., but there is also the possibility of misunderstanding.

Computers are no better than the human brain in that they do not guess the meaning of each step based on the meaning of the algorithm, so each step of the algorithm must have a definite meaning.

3) There are zero or more inputs. The algorithms and data in the program are interconnected. In an algorithm, what needs to be entered is the amount of data.

Inputs can be multiple or zero. In fact, zero input is not that the algorithm has no input, but that this input is not intuitively manifested and hidden in the algorithm itself.

4) There is one output or multiple outputs. The output is the result obtained by the implementation of the algorithm, which is the result obtained by the algorithm after data processing. Some algorithms output numerical values, some graphs, and some output is not so obvious.

An algorithm without output is meaningless.

5) Feasibility. The feasibility of an algorithm means that each step can be executed efficiently and with a definite result, and can be used to easily solve a class of problems.

An algorithm must possess the following properties:

1) The algorithm must be correct in the first place, that is, for any set of inputs, including reasonable inputs and unreasonable inputs, the expected output can always be obtained. An algorithm is not correct if it only gives the expected output to a reasonable input, but cannot anticipate the outcome of the output in an abnormal case.

2) The algorithm must be made up of a series of concrete steps, and each step can be understood and executed by the computer, rather than abstract and vague concepts.

4) no matter how complex the algorithm is, it must end and terminate after a finite step; i.e. the steps of the algorithm must be finite. Under no circumstances can an algorithm get bogged down in an infinite loop.

The solution to a problem can be expressed in a variety of ways; However, only solutions that meet the above four conditions can be called algorithms.

1) Impoverished.

The infiniteness of the algorithm means that the algorithm must be able to terminate after a finite number of steps;

2. Certainty.

Each step of the algorithm must be precisely defined;

3. Inputs.

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

4. Output items.

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

5) Feasibility.

Any computational step performed in an algorithm is something that can be broken down into basic executable operational steps, i.e., each computational step can be completed in a finite amount of time (also known as validity).

Algorithms can be macroscopic scored into three categories.

1. Limited, deterministic algorithms These algorithms terminate for a limited period of time. They may take a long time to perform the assigned task, but they will still terminate within a certain period of time. The results of such algorithms often depend on the input values.

2. Limited, non-deterministic algorithms These algorithms are terminated for a limited period of time. However, for a given numerical value, the result of the algorithm is not unique or deterministic.

3. Infinite algorithms are those that do not terminate because there are no defined conditions for terminating the definition, or because the defined conditions cannot be satisfied by the input data. Usually, infinite algorithms arise due to the failure to determine defined termination conditions.

There are five important characteristics that an algorithm should have:

1. Infiniteness: The infinity of the algorithm means that the algorithm must be able to terminate after a finite number of steps;

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

3. Inputs: An algorithm has 0 or more inputs to describe the initial situation of the operation object, and the so-called 0 inputs refer to the initial conditions set by the algorithm itself;

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

5. Feasibility: Any calculation step performed in the algorithm can be broken down into basic executable operation steps, that is, each calculation step can be completed in a limited time (also called validity).

An algorithm is a specific limited number of steps taken to solve a particular problem. A complete.

The computer arithmetic method must meet the following five criteria.

Generic rules or criteria: infinite, deterministic, feasibility, and exportability. Only with the above 5 characteristics can it be called an algorithm, and the most important of them is the infinity of the algorithm, if it does not have the property of infiniteness, it only has the other 4 properties.

What is Algorithm? What are the characteristics of the algorithm?

Definition of an algorithm.

Typically, the algorithm is defined as:"A sequence of subordinate orders prescribed to settle a particular task"。

5 basic features of the algorithm.

There is input. An algorithm must have 0 or more inputs. They are the amount given to the algorithm before it starts to operate.

These inputs are taken from a specific collection of objects. They can be provided externally using input statements, or they can be given within the algorithm using assignment statements.

There are outputs. An algorithm should have one or more outputs, and the amount of output is the result of the algorithm's calculations.

Certainty. Each step of the algorithm should be defined precisely and without ambiguity. For each case, the actions that need to be performed should be strictly and clearly defined.

There is poverty. An algorithm should end after an exhaustive step in execution no matter what the circumstances.

Effectiveness. Every operation in the algorithm must be basic enough. That is, in principle, they can all be executed precisely, even with a limited number of calculations with pen and paper.