Introduction to Algorithm

Sequential steps to solve a problem is
called algorithm. If steps are fallowed the problem will be solved. If
we have algorithm to solve a specific problem, it will be easy to
convert it into computer programme. An algorithm usually describes about
getting data, processing of data and show results. For example, if we
want to sum two numbers the algorithm will be written as:

Input 1^st number into A
Input 2^nd number into B
Sum = A + B
Print Sum
End

Control structure in algorithm

Control structures are used in every
computer language, algorithm is not a computer language, so algorithms
also support these control structures. Programming languages have three
types of execution structure.

Sequential
Selection
Iteration

Sequential

In this type of structure all the
instructions are executed sequentially in which they are written. Not a
single statement is skipped in this structure.

Selection

In this structure instruction are
executed or skipped based on given condition. Different checkpoints are
placed in the form of conditions. These conditions are compulsory to get
our required results.

An algorithm to show selection structure is as follows:

IF condition THEN

Instruction-1

ELSE

Instruction-2

END IF

Write an algorithm to find either a number is even or odd.

START
INPUT a number in A
IF A%2 == 0
PRINT number is even
ELSE
PRINT number is odd
END

Iteration

This structure is also known as loop
structure or repetition structure. Conditions are used in this type upon
which instructions are repeated to get our required result.

Given below is the structure of iteration structure:

LOOP

Set of instructions

END LOOP

Write an algorithm to sum of first N numbers.

START
INPUT a number in N
SET sum = 0
REPEAT step 5 FOR I = 1 to N
SUM = SUM + I
PRINT SUM
END

Read Count: 3 times

Comments

No comments yet.