Algorithm: What does Algorithm mean?

Ans: An algorithm is a step by step method of solving a problem. It is commonly used for data
processing, calculation and other related computer and mathematical operations.

An algorithm is also used to manipulate data in various ways, such as inserting a new data item,
searching for a particular item or sorting an item.

An algorithm is a detailed series of instructions for carrying out an operation or solving a problem. In a
non-technical approach, we use algorithms in everyday tasks, such as a recipe.

Technically, computers use algorithms to list the detailed instructions for carrying out an operation. For
example, to compute an employee’s paycheck, the computer uses an algorithm. To accomplish this task,
appropriate data must be entered into the system. In terms of efficiency, various algorithms are able to
accomplish operations or problem solving easily and quickly.

A step-by-step method of solving a problem or making decisions, as in making a diagnosis.

An established mechanical procedure for solving certain mathematical problems.

Properties of the algorithm

Finiteness: An algorithm must always terminate after a finite number of steps.

Definiteness: Each step of an algorithm must be precisely defined; the actions to be carried out must be
rigorously and unambiguously specified for each case.

Input: An algorithm has zero or more inputs, i.e., quantities which are given to it initially before the
algorithm begins.

Output: An algorithm has one or more outputs i.e., quantities which have a specified relation to the
inputs.

Effectiveness: An algorithm is also generally expected to be effective. This means that all of the
operations to be performed in the algorithm must be sufficiently basic that they can in principle be done
exactly and in a finite length of time.
Complexity of Algorithm:

It is very convenient to classify algorithms based on the relative amount of time or relative amount of
space they require and specify the growth of time /space requirements as a function of the input size.
Thus, we have the notions of:

1. Time Complexity: Running time of the program as a function of the size of input

2. Space Complexity: Amount of computer memory required during the program execution, as a
function of the input size.