CMPT 120 Lecture 2: Algorithms

• School: Simon Fraser University
• Department: Computing Science
• Course: CMPT 120
• Professor: Liaqat Ali

Document Summary

An algorithm is a sequence of unambiguous instructions for solving a problem , i. e. , for obtaining a required output for any legitimate input in a finite amount of time . An algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output . An algorithm is a sequence of computational steps that transform the input into the output . Unambiguous : each step of an algorithm has to be precisely defined. After reading an algorithm, there should be no question about what to do. Specific problem : an algorithm should always present a solution to a particular problem, or group of problems. Legitimate input : an algorithm might need some kind of input to do its job. Finite amount of time : if started, an algorithm must end eventually. Clear i/o : inputs and outputs should be defined clearly.