Algorithm definition

Learn that an algorithm is a finite sequence of steps turning input into output.

Algorithm definition

An algorithm is a finite sequence of steps taken to solve a problem. Every algorithm takes an input, processes the steps in order, and produces an output.

For example, a recipe, a route direction or a mathematical procedure is an algorithm. Steps must be definite and ordered.

Five core properties

An algorithm has five core properties: finiteness, definiteness, input, output and effectiveness.

These properties guarantee correct execution and let a machine run the algorithm without error.

Exercise Write pseudocode

Write add(a, b). Return a + b and print 8 with print(add(3, 5)).

Show example solution

def add(a, b):
    # Add two numbers
    return a + b
print(add(3, 5))

Test yourself

Which is an algorithm property?
- Finiteness
- Infinity
- Randomness
- Ambiguity
Show answer

Finiteness — Finiteness is an algorithm property.

Algorithm output

Every algorithm produces at least one ____.

Show answer

Every algorithm produces at least one output.

Algorithm definition: match the terms

Finiteness

Ends
Input

Starting
Output

Result
Definiteness

Unambiguous

Next lesson: Algorithm properties

We Are Enhancing Your Experience

Cookie Preferences

Strictly Necessary Cookies

Analytical Cookies