Representing Algorithms




algorithms are a set of instructions
flow charts are a visual representation of the instructions, using different shapes to identify key inputs/outputs
Pseudo code it is a simple way of describing a set of instructions that does not have to use specific syntax.


Decomposition means breaking a problem into a number of sub-problems, so that each sub-problem accomplishes an identifiable task which might itself be sub divided.
                                   e.g- factorising an equation:
                                                  -collect light terms
                                                  - add them


Abstraction is the process of removing unnecessary detail from a problem.


An algorithm is a sequence of steps that can be followed to complete a task. Be aware that a computer program is a implementation of an algorithm is not a computer program.


Algorithms came from Maths they have been using them from a long time.

Pseudo Code

•INPUT – indicates a user will be inputting something

•OUTPUT – indicates that an output will appear on the screen

•WHILE – a loop (iteration that has a condition at the beginning)

•FOR – a counting loop (iteration)

•REPEAT – UNTIL – a loop (iteration) that has a condition at the end

•IF – THEN – ELSE – a decision (selection) in which a choice is made

Any instructions that occur inside a selection or iteration are usually indented

PSEUDO CODE