Algorithms Definition and concept 

The idea of ​​algorithms in computers basically stems from the concept of algorithms. It is a fundamental and rule-of-the-art method on which to build, design programs, and computer processes, and anyone wanting to understand the fundamentals of computer operations should take a deep look at the principle of algorithms in computers.

The concept of algorithms in computers

If you want the computer to do anything, you must first write a computer program, and write a computer program, you have to tell your computer accurately and in detailed steps what you want it to do, so that the computer performs these steps perfectly professionally, and thus executes the program, which leads to The intended target application. .

When you ask the computer to do something, you can also choose how to do it, and here comes the role of algorithms in the computer, as it is considered a simple technique to achieve the intended goal.

In the world of computer programming, there is more than one method, i.e. an algorithm, to accomplish the required tasks and operations, and each algorithm differs with its pros and cons due to its difference in the implementation of operations.

Types of algorithms

When looking at algorithms in computers from the perspective of different ways of working, we will have these main types:

Ranking algorithm

The most widespread and used, as its name suggests, is based on the order of menus, as computer work requires the organization and arrangement of many menus and lists of programming commands.

This algorithm branches into several subtypes as well: quick order, merge order, bubble order, and more.

Comprehensive search algorithm

An approach based on looking at the solutions and possibilities available and choosing the best one.

The principle of this algorithm is to break down math problems into small parts and then solve them.

Greedy solution algorithm

A method to solve the problems that you face using the best solutions or methods available at the present time, with complete disregard for the future, or future solutions and methods.

Dynamic programming algorithm

It depends on extracting or reaching a solution through the previous side or small solutions, or studying previous solutions and devising a new solution that suits the situation before it, and it is considered one of the most recent and effective algorithms.

Examples of algorithms in a computer

In order to understand how algorithms work in a computer, it is necessary to simplify it into a simple example, and let's say you have a friend who is arriving at your city airport and must transfer from the airport to your home.

From a computer perspective, more than one specific algorithm must be defined in clear steps, in order to achieve this goal, or sometimes the goal is simple and it is sufficient to define one algorithm to achieve it, such as the example in which we are talking about receiving a friend from the airport.

For example, we developed an algorithm for taxi ride, and set clear and detailed steps for this algorithm: First; Go to the taxi stand, take the taxi, and give the taxi driver your home address.

Or we can use a second algorithm, such as relying on the bus ride, and any algorithm that follows it must be accompanied by clear and orderly steps, because as we said, the computer follows these steps accurately and carefully.

As we can see, the existence of different types of algorithms is due to the different way each of them executes the desired goal, as the steps of taking a taxi differ from the steps of riding the bus, and just as there are different negatives and positives when compared to riding a bus with a taxi, the algorithms in the computer also differ in their efficiency And its effectiveness.