Download An algorithm is a finite sequence of instructions for solving a

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Gene expression programming wikipedia , lookup

Smith–Waterman algorithm wikipedia , lookup

Transcript
ICS801: Design and Analysis of Algorithms
ASSIGNMENT ONE
REG: P58/76089/2012
NAME: AKONDO PATRICK OLWALO
An algorithm is a procedure for solving a problem in terms of the actions to be executed
and the order in which those actions are to be executed. Thus a computer algorithm is a
finite sequence of instructions for solving a computational problem.
An algorithm receives a specific set of input, performs the sequence of instructions on
them to produce desired output. The sequence of instructions of the algorithm must be
finite, therefore the algorithm must terminate.
An algorithm is usually expressed using natural language, pseudo code, or flowcharts and
implemented using programming languages or electronic circuits
Finding repeated occurrence of a given string a long DNA sequence is an example of a
problem solved by algorithms.