GROUP

4
ALGORITHMS
Algorithms are step-by-step procedures or formulas for solving a
problem or accomplishing a task. They are essentially sets of rules that
define a sequence of operations to be performed. In computer science,
algorithms are fundamental to the way computers process data and
perform computations efficiently.
THEREFORE ALGORITHM REFERS TO A SEQUENCE OF FINITE STEPS TO
SOLVE A PARTICULAR PROBLEM.
 PROPERTIES OF ALGORITHM
 It should terminate after a finite time.
 It should produce at least one output.
 It should take zero or more input.
 It should be deterministic means giving the same
output for the same input case.
 Every step in the algorithm must be effective i.e.
every step should do some work.
 BASIC ALGORITHM
There are three basic algorithms. They are:
• Sequencing
• Selection
• Iteration
 SEQUENCING ALGORITHM
• It is the specific order in which
instructions are performed in an
algorithms.
• Example
Brushing your teeth
 SELECTIONAL ALGORITHM
• It is used for sorting of values and
items.
• Example
 Number group(even, odd, prime and
etc)
 Letterers (lower, upper, vowels )
 ITERATIONAL ALGORITHM
• It is a function that repeats a block of
codes in a specified order, often until
a specific result occurs.
 SUB-ALGORITHM
• It is a block of instructions that is
executed when it is called from some
other point of the algorithm
 RECURSIVE ALGORITHM
• It Is the simplest terms, is a method of
problem solving where the solution to
a problem depends on the solution to
smaller instances of the same
problems
RECURSIVE ALGORITHM

SUB-ALGORITHM

ALGORITHM