INTRODUCTION
Using computer to solve a problem involves directing it
on what steps it must follow to get the problem solved.
The steps it must follow is called algorithm. An algorithm
is a finite sequence of explicit instructions to solve a
problem with a finite amount of effort in a finite amount of
time (William, 2005; Alfred et al., 2002).
Algorithms are paramount in computer programming,
but an algorithm could be of no use even though it is correct
and gives a desired output if the resources like
storage and time it needs to run to completion are
intolerable.
Instructions can be executed any number of times,
provided the instructions themselves indicate repetition.
However, no matter what the input values may be, an
algorithm terminates after executing a finite number of
instructions. A program is thus an algorithm in as much
as it does not loop infinitely on any input (Sara and Allen,
2000).
Five important features of algorithm are (Donald, 1997):
INTRODUCTION
Using computer to solve a problem involves directing it
on what steps it must follow to get the problem solved.
The steps it must follow is called algorithm. An algorithm
is a finite sequence of explicit instructions to solve a
problem with a finite amount of effort in a finite amount of
time (William, 2005; Alfred et al., 2002).
Algorithms are paramount in computer programming,
but an algorithm could be of no use even though it is correct
and gives a desired output if the resources like
storage and time it needs to run to completion are
intolerable.
Instructions can be executed any number of times,
provided the instructions themselves indicate repetition.
However, no matter what the input values may be, an
algorithm terminates after executing a finite number of
instructions. A program is thus an algorithm in as much
as it does not loop infinitely on any input (Sara and Allen,
2000).
Five important features of algorithm are (Donald, 1997):
การแปล กรุณารอสักครู่..