Summary - Algorithm concept

Tie definition, properties and pseudocode together with a mini task.

Summary - Algorithm concept

In this group you learned what an algorithm is, its five core properties and how to express it in pseudocode. An algorithm has finite, definite and effective steps.

Pseudocode is a human-friendly way to write algorithms using if, for, return.

Exercise Subtract two numbers

Write subtract(a, b). Return a - b and print 7 with print(subtract(10, 3)).

Show example solution

def subtract(a, b):
    # Subtract two numbers
    return a - b
print(subtract(10, 3))

Test yourself

Summary - Algorithm concept: match the terms

Algorithm

Step sequence
Finiteness

Ends
Pseudocode

Human reads
Output

Result

Algorithm definition

An algorithm is a ____ sequence of steps.

Show answer

An algorithm is a finite sequence of steps.

Which is required for an algorithm?
- Infinite loop
- Randomness
- Ambiguity
- Finiteness
Show answer

Finiteness — Finiteness is required.

Next lesson: Time complexity

We Are Enhancing Your Experience

Cookie Preferences

Strictly Necessary Cookies

Analytical Cookies