In Arabic it is where we can find the etymological origin of the term algorithm that we are now going to analyze in depth. More exactly, 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.

It was in Baghdad where he developed a large part of his career and it is that he moved there to, by order of the caliph, create a superior 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 said 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 as the father of algebra but also as the one who was in charge of introducing our numbering system.

It is called **algorithm** still **finite group of operations organized in a logical and orderly way** that allows to solve a certain **trouble**. It is a series of instructions or established rules that, through a succession of steps, allow us to arrive at a result or solution.

According to experts in mathematics, algorithms allow working from a basic or initial state and, after following the proposed steps, reaching a **solution**. It should be noted that, although algorithms are usually associated with the mathematical field (since they allow, to name specific cases, 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.

In addition to all the 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 carried out through three levels. Thus, first of all, we meet 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, pseudo-code, natural language and also through what are known as flow diagrams.

An instruction manual for the operation of a household appliance and a series of orders from the boss to an employee to perform a certain task may 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 referred to as the **fixed number of steps required to transform input information (a problem) into an output (your solution)**. However, some algorithms have no end or do not solve a particular problem.

There are certain properties that apply to all algorithms, with the exception of the so-called parallel algorithms: the **sequential time** (the algorithms work step by step), the **abstract state** (each algorithm is independent of its implementation) and the **bounded exploration** (The transition between states is determined by a finite and fixed description).

Finally, it should be mentioned that algorithms are very important in the **computing** since they allow to represent data like sequences of bits. A program is an algorithm that tells the **computer** what specific steps you need to take to complete a task.

## Leave a Reply