Algorithm is a step-by-step procedure, which defines a set of instructions to be

executed in a certain order to get the desired output. Algorithms are generally created
independent of underlying languages, i.e. an algorithm can be implemented in more
than one programming language.
From the data structure point of view, following are some important categories of
algorithms −
●​ Search − Algorithm to search an item in a data structure.
●​ Sort − Algorithm to sort items in a certain order.
●​ Insert − Algorithm to insert item in a data structure.
●​ Update − Algorithm to update an existing item in a data structure.
●​ Delete − Algorithm to delete an existing item from a data structure.

Characteristics of an Algorithm - Not all procedures can be called an

algorithm. An algorithm should have the following characteristics −

●​ Unambiguous − Algorithm should be clear and unambiguous. Each of its steps

(or phases), and their inputs/outputs should be clear and must lead to only one
meaning.
●​ Input − An algorithm should have 0 or more well-defined inputs.
●​ Output − An algorithm should have 1 or more well-defined outputs, and should
match the desired output.
●​ Finiteness − Algorithms must terminate after a finite number of steps.
●​ Feasibility − Should be feasible with the available resources.
●​ Independent − An algorithm should have step-by-step directions, which should
be independent of any programming code.
 ●​
In many cases, there are multiple ways to perform a specific
operation within a software program. Therefore, programmers
usually seek to create the most efficient algorithms possible. By
using highly-efficient algorithms, developers can ensure their
programs run as fast as possible and use minimal system
resources. Of course, not all algorithms are created perfectly the
first time. Therefore, developers often improve existing
algorithms and include them in future software updates. When
you see a new version of a software program that has been
"optimized" or has "faster performance," it most means the new
version includes more efficient algorithms.

How to Write an Algorithm?

There are no well-defined standards for writing algorithms. Rather, it is problem and
resource dependent. Algorithms are never written to support a particular programming
code.
As we know that all programming languages share basic code constructs like loops
(do, for, while), flow-control (if-else), etc. These common constructs can be used to
write an algorithm.
We write algorithms in a step-by-step manner, but it is not always the case. Algorithm
writing is a process and is executed after the problem domain is well-defined. That is,
we should know the problem domain, for which we are designing a solution.
Example

Let's try to learn algorithm-writing by using an example.

Problem − Design an algorithm to add two numbers and display the result.
Step 1 − START
Step 2 − Read a , b
Step 3 − c = a + b
Step 4 − display c
Step 5 − STOP
Writing step numbers, is optional.
We design an algorithm to get a solution of a given problem. A problem can be solved
in more than one ways.

Hence, many solution algorithms can be derived for a given problem. The next step is
to analyze those proposed solution algorithms and implement the best suitable
solution.

Algorithm Analysis
Efficiency of an algorithm can be analyzed at two different stages, before
implementation and after implementation. They are the following −
●​ A Priori Analysis − This is a theoretical analysis of an algorithm. Efficiency of
an algorithm is measured by assuming that all other factors, for example,
processor speed, are constant and have no effect on the implementation.
●​ A Posterior Analysis − This is an empirical analysis of an algorithm. The
selected algorithm is implemented using programming language. This is then
executed on target computer machine. In this analysis, actual statistics like
running time and space required, are collected.
We shall learn about a priori algorithm analysis. Algorithm analysis deals with the
execution or running time of various operations involved. The running time of an
operation can be defined as the number of computer instructions executed per
operation.

Algorithm Complexity
Suppose X is an algorithm and n is the size of input data, the time and space used by
the algorithm X are the two main factors, which decide the efficiency of X.
●​ Time Factor − Time is measured by counting the number of key operations
such as comparisons in the sorting algorithm.
●​ Space Factor − Space is measured by counting the maximum memory space
required by the algorithm.
The complexity of an algorithm f(n) gives the running time and/or the storage space
required by the algorithm in terms of n as the size of input data.

Space Complexity
Space complexity of an algorithm represents the amount of memory space required by
the algorithm in its life cycle. The space required by an algorithm is equal to the sum of
the following two components −
●​ A fixed part that is a space required to store certain data and variables, that are
independent of the size of the problem. For example, simple variables and
constants used, program size, etc.
●​ A variable part is a space required by variables, whose size depends on the size
of the problem. For example, dynamic memory allocation, recursion stack
space, etc.
Space complexity S(P) of any algorithm P is S(P) = C + SP(I), where C is the fixed part
and S(I) is the variable part of the algorithm, which depends on instance characteristic
I. Following is a simple example that tries to explain the concept −
Algorithm: SUM(A, B)
Step 1 - START
Step 2 - C ← A + B + 10
Step 3 - Stop
Here we have three variables A, B, and C and one constant. Hence S(P) = 1 + 3. Now,
space depends on data types of given variables and constant types and it will be
multiplied accordingly.
Time Complexity
Time complexity of an algorithm represents the amount of time required by the
algorithm to run to completion. Time requirements can be defined as a numerical
function T(n), where T(n) can be measured as the number of steps, provided each step
consumes constant time.
For example, addition of two n-bit integers takes n steps. Consequently, the total
computational time is T(n) = c ∗ n, where c is the time taken for the addition of two bits.
Here, we observe that T(n) grows linearly as the input size increases.

Sample Alogrithms –

1.​ Alogrithm to find bigger of two given numbers –

10 Start
20 Read A,B
30 If A > B then
​ Print “Bigger Number is –“ , A
Else
​ Print “Bigger Number is –“, B
Endif
40 Stop
50 End

You can see there are two statements to mark end of algorithm, STOP and END. These are a bit different.
STOP can come more than once in an algorithm, it represents the logical end of algorithm. Depending
upon input values and conditions the algorithm can have more than one logical ends. END represents
physical end of algorithm, nothing can be written after END in algorithm.

2.​ Alogrithm to find whether given number is even or odd –

10 Start
20 Read A
30 If A MOD 2 = 0 Then
​ Print “Number is Even”
Else
​ Print Print “Number is Odd”
Endif
40 Stop
50​ End
 Alogrithm to find sum of n numbers –

10 Start
20 Read N
30 I = 1
40 Sum = 0
50 Read NUM
60 Sum =Sum + NUM
70 I= I+1
80 If I > N then GOTO 50
90 Print Sum
100 Stop
110 End

You can see in the above algorithm that steps 30 to 80 represent a typical For loop.