What is an algorithm? Definition and examples
Posted: Thu Jan 23, 2025 6:51 am
An algorithm is a predefined procedure that solves problems or tasks step by step. Although algorithms are found in almost all areas of everyday life, they are essential for computer science and software programs. Well-known examples are Google's algorithm, which determines the ranking of search results, and the news algorithms of Facebook or Instagram.
Brief definition of algorithms
Algorithms are predefined, finite sequences of actions used to solve problems. In other words, they are used to perform specific tasks using fixed sequences of steps or by converting input values into output values. The steps are predetermined and are executed in a sequence. Algorithms are independent of a specific language and therefore work with and without machines. However, algorithms are not only found in mathematics and computer science, they are also all around us: from traffic lights to the call function of an elevator.
6 properties that an algorithm must have
Whereas algorithms were previously defined randomly, today it is possible psychiatrist email database to identify an algorithm according to six properties:
Uniqueness/Effectiveness
Each step in an algorithm's sequence of actions must be efficient and unambiguous . This means that, in order to obtain a result or output value, each instruction must make sense and be fit for purpose.
Execution
Individual actions and steps must be executable and logical .
Finitude
The goal of an algorithm is to convert input data into output data. This is only possible if the process is finite . Algorithms must be finite in form, for example by a limited number of characters or a limited memory.
Termination
Individual executable, logical, and finite steps must lead to a result in a finite time. The sequence must be goal-directed and not end in an endless loop with no result.
Determination
The same inputs under the same conditions must lead to the same results . Only in this way can algorithms ensure that an application and the solution to a problem work reliably.
Determinism
In the sequence of steps of the algorithm, there is always only one way to solve the problem. Thus, subsequent steps are clearly defined by the intermediate results and are not random .
Brief definition of algorithms
Algorithms are predefined, finite sequences of actions used to solve problems. In other words, they are used to perform specific tasks using fixed sequences of steps or by converting input values into output values. The steps are predetermined and are executed in a sequence. Algorithms are independent of a specific language and therefore work with and without machines. However, algorithms are not only found in mathematics and computer science, they are also all around us: from traffic lights to the call function of an elevator.
6 properties that an algorithm must have
Whereas algorithms were previously defined randomly, today it is possible psychiatrist email database to identify an algorithm according to six properties:
Uniqueness/Effectiveness
Each step in an algorithm's sequence of actions must be efficient and unambiguous . This means that, in order to obtain a result or output value, each instruction must make sense and be fit for purpose.
Execution
Individual actions and steps must be executable and logical .
Finitude
The goal of an algorithm is to convert input data into output data. This is only possible if the process is finite . Algorithms must be finite in form, for example by a limited number of characters or a limited memory.
Termination
Individual executable, logical, and finite steps must lead to a result in a finite time. The sequence must be goal-directed and not end in an endless loop with no result.
Determination
The same inputs under the same conditions must lead to the same results . Only in this way can algorithms ensure that an application and the solution to a problem work reliably.
Determinism
In the sequence of steps of the algorithm, there is always only one way to solve the problem. Thus, subsequent steps are clearly defined by the intermediate results and are not random .