algorithm
algorithm
features of an algorithm
- finite: Must terminate after n < ∞ steps.
- Definiteness: Each step must be precisely defined.
- Input: If you think of a function, then the algorithm should take an
input., eg 2 positive integers in the euclidean algorithm
- Output: It should evaluate to an answer
- Effectiveness: Each step must be computable.
How do I get effectiveness?
taocp
effectiveness
“This means that all of the operations to be performed in the
algortithm must be sufficiently basic that they can in principle be done
exactly and in a finite length of time by a man using pencil and
paper.”
[[computational_method___20241013_184605|computational_method]]
backlinks