The computational algorithms represent a sequence of steps designed to perform a specific task. It can also be said that they represent a set of clear instructions that are programmed into a computer in order to solve a problem.
Within the computing field or any science, an algorithm serves as the basis for creating a methodology with defined and finite stages.
Its use is intended to give a generic solution to a dilemma, allowing us to use it again and again to obtain the expected result.
Characteristics of computational algorithms
Proposed by mathematician Alan Turing to bring this concept from mathematics to the field of computer science, the algorithm is a process defined by the following:
-A limited sequence of steps, which are clearly defined and each one is independent of the other.
-An agent (human or inhuman) is the one who applies each of the stages of the process at a given time.
-The agent has the ability to interpret the operational instructions and at the same time save the information given.
-When a specific methodology is carried out, the result will always be the same in each step and based on the initial data.
-As in any process, it ends with a result.
There are cases in which the procedure requires a concrete solution and those that do not. Repetitive or irregular algorithms that don't finish are very common in computing.
An example of them are operating systems such as Windows, MacOS and Linux, which have to continue to function to serve as a platform for other programs and processes.
Types
Both in computer science and in other disciplines, 3 types of algorithms can be identified, which are: sequential, conditional and repetitive. In addition, there are those that are qualitative (they use words) and quantitative (they use numerical calculations).
Some famous computational algorithms that are very useful in practice serve different functions.
Thus, we find the Euclid algorithm, which is used to divide, the Gaussian algorithm to solve linear equations, or the Floyd-Wrashall algorithm, to find the shortest path between weighted graphs.
Examples
Algorithms are used in different situations, they seek to provide a solution to a problem, and for this a standard procedure is not followed.
When the mechanism to quickly and efficiently solve a specific task is discovered, its execution does not require an understanding of how the method works.
A simple example is to follow a recipe to make a cake, which uses a series of instructions and steps to obtain it.
Likewise, computers are capable of solving various types of problems by applying formulas that have a special language.
In this case, the computational algorithms represent code written in different ways that can only be understood by the machine.
An important part of this procedure is to transform an idea into a logical sequence that the PC can interpret.
In this way, programmers go from simple tasks to more complex ones. To do this, they often turn to recipes that others have created to adjust them to what they need to solve.
References
- Denver University. What is an algorithm and how to use it in programming? Retrieved on 12/12/2017 from quora.com
- Vasquez B., Carlos. Programming Methodology I. Retrieved on 12/12/2017 from moodle2.unid.edu.mx
- Bembibre, Victoria (2009). Definition of algorithm. Recovered on 12/12/2017 from definicionabc.com
- Colombo, Jorge T. (2001). Computer algorithm. Recovered on 12/12/2017 from avizora.com
- How stuff works. What is a computer algorithm? Retrieved on 12/12/2017 from howstuffwworks.com