Concept of Algorithm in Computers

Concept of Algorithm in Computers

The step by step procedure which is designed to accomplish an operation/ task, if followed correctly leaves a definite results which are known earlier by us. We Check at each step the conditions which are followed or not. If followed then accomplish task 1 and not followed it accomplish task 2. So there is definite results which we knows earlier. The Concept of Algorithm in Computers is expressed here in simple methods and methodology.

Who Invented the First Algorithm?

The person who invented the first algorithm was “Abdullah Muhammad bin Musa al-Khwarizmi” – a Persian scientist, astronomer and mathematician. He was also known as “The father of Algebra”.

Algorithms have a definite beginning and a definite end, and a finite number of steps. An algorithm produces the same output information given the same input information, and several short algorithms can be combined to perform complex tasks such as writing a complex computer program, Chocolate cake recipe a diagnosis, a flow chart for calculating GCD of two numbers, etc. An algorithm is an effective method that can be expressed within a finite amount of space and time and in a well-defined formal language for solving a task completely. Alternately – An algorithm is a set of instructions designed to perform a specific task. This can be a simple process, such as multiplying two numbers, or a complex operation, such as playing a compressed video file. Our google Search engines use Scheduled algorithms to display the unique relevant results from their search index for specific queries related to user.

Some Major Characteristics of Algorithms

The algorithms is a very precise and valuable methods by which a user can process its information by exact manner. Some of the major properties or characteristics contained in algorithms are:

  1. It should be precise and unambiguous i.e. each and every instruction should be clear and should have only one meaning.
  2. Characteristics of Finiteness – the algorithm stops after a finite number of executions.
  3. The algorithm receives Input, produces Output after execution.
  4. The result of each step are uniquely defined and only depends on the input and result the defined output.

Classification of Algorithms

There are numerous ways to classify algorithms which are designed according to use and flexibility of users in algorithms. These are used as per demand at the time of processing.

  1. Recursion
  2. Logical
  3. Serial, Parallel or distributed
  4. Deterministic or non-deterministic
  5. Exact or approximate
  6. Divide and simplify

Some Examples of Algorithm Processing

  1. How to Print 1 to 10

The algorithm to print numbers from 1 to 10 is shown below.

Step 1 – Initiate Y as 0

Step 2 – Increment Y by 1

Step 3 – Print Y

Step 4 – If Y is less than 10 then go to step no 2

2.How to convert Fahrenheit (F) to Celsius (C) of Temperature Parameter

Step 1 – Read Temperature Parameter in Fahrenheit

Step 2 – Calculate with formula; Celsius (C) = 5/9*(F-32)

Step 3 – Display the Value of C

This is a short topic related to Concept of Algorithm in Computers. We will discuss the next topic related to algorithms implementation and contribution in Computers.

Leave a Reply