Introduction to algorithms

Main concepts of this manual, as well as an introduction to its contents.

The development of algorithms is a fundamental issue in the design of programs or solutions. Therefore, the student must have good bases that will help him to create his programs easily and quickly.

The following documentation can serve as support for tutors or teachers, in their daily teaching work and for the student, facilitating the development of their analytical and creative capacity, in order to improve their skills in the development of algorithms that serve as the basis for the coding of the different programs that you will have to develop throughout your career.

Contents

Subsequent articles will show the development of the algorithm topic as a course. There is a series of additional documentation for conceptual reinforcement, given an important part in the process of the subject in question.

WHAT IS ALGORITHM?

The word algorithm is derived from the Latin translation of the Arabic word alkhowarizmi, the name of an Arab mathematician and astronomer who wrote a treatise on the manipulation of numbers and equations in the 9th century.

An algorithm is a series of organized steps that describes the process that must be followed to solve a specific problem.

TYPES OF ALGORITHMS…?

There are two types and they are called like this because of their nature:

• Qualitative: They are those in which the steps are described using words.
• Quantitative: They are those in which numerical calculations are used to define the steps of the process.

Algorithmic Languages

An algorithmic language is a set of symbols and rules that are used to explicitly describe a process.

Types of Algorithmic Languages

Methodology for the creation of algorithms

Now that we know what an algorithm is, we are going to study the methodology for solving a problem using a computer. The creation of an algorithm and its programming is a stage, but as a programmer you must perform several steps before and after.

The computer is a machine that by itself cannot do anything, it needs to be programmed, that is, to introduce instructions or orders that tell it what to do. A program is the solution to an initial problem, so everything starts there: in the Problem. The programming process is as follows: Given a certain problem, the programmer must devise a solution and express it using an algorithm (this is where it comes into play); After this, he must code it in a certain programming language and finally execute the program on the computer, which reflects a solution to the initial problem. This is roughly what the computer programmer does.

The part that corresponds to this manual is: “Given a certain problem we must devise a solution and express it using an ALGORITHM!”.

Methodology for the solution of problems by means of computer

• DEFINITION OF THE PROBLEM

  This phase is given by the statement of the problem, which requires a clear and precise definition. It is important that you know what you want the computer to do; As long as this is not fully known, there is little point in continuing with the next stage.

• PROBLEM ANALYSIS

  Once you have understood what you want from the computer, you need to define:

  • The input data.
  • What is the information you want to produce (output)
  • The methods and formulas that are needed to process the data.

  A very practical recommendation is to put yourself in the place of the computer and analyze what needs to be ordered and in what sequence to produce the expected results.

• ALGORITHM DESIGN

  The characteristics of a good algorithm are:

  • It must have a particular starting point.
  • Should be defined, must not allow double interpretations.
  • It must be general, that is, it must support most of the variants that can be presented in the definition of the problem.
  • It must be finite in size and runtime.
  • Algorithm Design
  • Desktop Test or Debug

The verification that an algorithm is made to see if it is well done is called a desktop test. This test consists of taking specific data as input and following the sequence indicated in the algorithm until a result is obtained. The analysis of these results will indicate if the algorithm is correct or if, on the contrary, there is a need to correct it or make adjustments.