What Is An Algorithm
Uploaded by
ScribdTranslationsWhat Is An Algorithm
Uploaded by
ScribdTranslationsWhat is an algorithm:
An algorithm is a step-by-step procedure to achieve an end. It is a concept
commonly related to the field of computer science.
A computer algorithm is a finite sequence of instructions that carry out a
a series of processes to respond to certain problems. That is, an algorithm
A computer scientist solves any problem through concise instructions and rules.
showing the obtained result.
Algorithms are very important in the world of computer science as they allow for
programmer solves the problem before writing it in a programming language that
understand the machine or computer.
What are programs:
You program a logical sequence of instructions to execute specific tasks on a
computer.
A computer program or computer software is a piece of software, that is,
complex sequence of instructions and orchestrated processes to accomplish a specific task in
a computer or computer system. These programs can be pre-installed programs
in the computer, like the Operating System that controls all its functioning, or
they can be additionally added by the user.
Algorithmic language:
It is a set of symbols and rules that are used to explicitly describe a process.
Programming language:
A programming language is an element within computer science that allows us to create
programs through a set of instructions, operators, and syntax rules; that puts to
programmer's arrangement for them to communicate with hardware devices and
existing software.
Characteristics and elements to build an algorithm:
The fundamental characteristics that every algorithm must fulfill are:
An algorithm must be precise and indicate the order of execution of each step.
An algorithm must be defined. If an algorithm is followed twice, the same result should be obtained.
same result every time.
An algorithm must be finite. The algorithm must terminate at some point; that is,
It must have a finite number of steps.
An algorithm must be readable: The text describing it must be clear, so that it allows
understand it and read it easily.
Elements to build an algorithm:
An algorithm consists of data and statements
The data is stored in variables or constants which are involved in
expressions.
The sentences, for their part, are the actions that can be executed, in general.
they perform calculations, inputs/outputs, and flow control of the algorithm.
Parts of an algorithm:
Input or entry. The input of the data that the algorithm needs to operate.
Process. It refers to the formal logical operation that the algorithm will undertake with the
received from the input.
Output or exit. The results obtained from the process on the input, once finished the
execution of the algorithm.
Ways to represent an algorithm: natural language, pseudocode, and flowchart.
flow
Natural language:
They are those languages that have been generated spontaneously in a group of speakers.
with the purpose of communicating, unlike other languages, such as a language
built, the programming languages or the formal languages used in the study
from formal logic, especially mathematical logic.
The algorithms written in this language are characterized by following a process of
common and logical execution, describing step by step each one of the
activities to be carried out to solve a specific problem.
The disadvantages of writing algorithms in this language are: ambiguity, the lack of
universality and the breadth of it, which generates errors and cannot be interpreted.
correctly by the computer.
Pseudocode
• Mixture of programming language and Spanish (or English or any other language) that is
used, within structured programming, to design a program.
In essence, pseudocode can be defined as a specification language for
algorithms.
It is the narrative representation of the steps that an algorithm must follow to provide
solution to a specific problem. The pseudocode uses words that indicate the
process to be carried out.
Flowcharts
They are based on the use of various symbols to represent specific operations.
They are called flowcharts because the symbols used are connected by means of
arrows to indicate the sequence of the operation.
Trace of an algorithm (cold run):
The trace of an algorithm can be defined as the manual execution in a sequential manner.
of the sentences that compose it. The trace of an algorithm (or program) indicates the
sequence of actions (instructions) for its execution, as well as the value of the variables
of the algorithm (or program) after each action (instruction).
