Monday, November 10, 2008

1.1. Algorithms

This section begins with an investigation of the etymology of the word “algorithm”.

Knuth defines the following characteristics for an algorithm;

  1. Finiteness. An algorithm must always terminate after a finite number of steps.
  2. Definiteness. Each step must be carried out rigorously and unambiguously.
  3. Input. An algorithm has zero or more inputs.
  4. Outputs. An algorithm has one or more outputs.
  5. Effectiveness. Steps must be sufficiently basic so that they could be done using a pen and paper.

No comments: