An algorithm is defined as a step-by-step procedure to produce an output from given inputs. It must be unambiguous, have well-defined inputs and outputs, terminate after a finite number of steps, and be feasible with available resources. A sample algorithm is provided that increments a variable until it reaches a threshold.

1. Algorithms

2. Algorithm?
▫ 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.
2

3. Characteristics of an Algorithm
▫ 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.
3

4. Sample Algorithm
Step 1: Initialize X as 0,
Step 2: Increment X by 1,
Step 3: Print X,
Step 4: If X is less than 20 then go back to step 2.
4

5. Just try….
▫ Write an algorithm to determine whether a student
passed the exam or not
5

6. Algorithm
Complexity
Coming Up
6