An algorithm is a series of rules or instructions that, based on a sequence of steps, allow us to reach a result.
Arabic is where we can find the etymological origin of the term algorithm that we are now going to analyze in depth. More precisely, it is found in the name of the mathematician Al-Khwarizmi, who was born in the Middle Ages in one of the areas of what is now known as Uzbiekistan, in central Asia.
Baghdad was where he developed a large part of his career and he moved there to, by order of the caliph, create a higher center for scientific research that was called the House of Wisdom. Various treatises on algebra or astronomy were some of the works carried out by this wise man, which has also led to the creation of another series of scientific terms such as algebra or figures.
Such was the importance of this historical figure that he is currently considered not only the father of algebra but also as the person in charge of introducing our numbering system.
Algorithm concept
An algorithm is called a finite group of operations organized in a logical and orderly manner that allows solving a certain problem . It is a series of established instructions or rules that, through a succession of steps, allow us to arrive at a result or solution.
According to mathematics experts, algorithms allow you to work from a basic or initial state and, after following the proposed steps, reach a solution . It should be noted that, although algorithms are usually associated with the mathematical field (since they allow, to cite specific cases, to find out the quotient between a pair of digits or determine what is the greatest common divisor between two figures belonging to the group of integers) , although they do not always imply the presence of numbers.
An algorithm makes it possible to represent data as bits.
Some considerations
In addition to everything stated above, in the mathematical field, and when we are determined to carry out the description of one of these algorithms, we must take into account that it can be done through three levels. So, first of all, we find the high level, which is the formal description and finally the implementation task.
Likewise, we cannot ignore that algorithms can be expressed through programming languages, pseudocode, natural language and also through what are known as flowcharts.
An instruction manual for the operation of an appliance and a series of orders from the boss to an employee to perform a certain task can also include algorithms.
This breadth of meaning allows us to appreciate that there is no formal and unique definition of an algorithm. The term is usually noted as the fixed number of steps necessary to transform input information (a problem) into an output (its solution) . However, some algorithms have no end or do not solve a particular problem.
Algorithm properties
There are certain properties that apply to all algorithms, with the exception of the so-called parallel algorithms: sequential time (algorithms work step by step), abstract state (each algorithm is independent of its implementation) and bounded exploration (the transition between states is determined by a finite and fixed description).
Finally, it is worth mentioning that algorithms are very important in computing since they allow data to be represented as sequences of bits. A program is an algorithm that tells the computer what specific steps to follow to perform a task.