Skip to content
AI-grafen
BInvestigatorProgramming· about 25 min· fundamentals that rarely change· verified 2026-09-20· EN

Algorithmic thinking

Break down a problem into steps, use repetition and conditions, and determine whether an algorithm solves the problem for all possible inputs — not just one example.

Prerequisites

Everyday explanation

An algorithm is a systematic procedure: a sequence of steps that solves a type of problem, not just a single case. "Find the highest value in a dataset" must work regardless of what values are in the data.

Two basic components make the procedure robust:

  • Repetition — "perform this step for every item in the data".
  • Conditions — "if the value is higher than the current maximum, update the reference value".

Intuition

Find the highest value in a list:

max = first value
for each value in the list:
    if value > max:
        max = value
return max

Mentally test the logic with the list [3, 9, 2]. Then with [−5, −1]. Then with an empty list — where the algorithm fails. Identifying such edge cases is a central part of developing robust algorithms.

Mastery means

  • Write an algorithm with a loop and a condition
  • Find a case where a given algorithm gives the wrong answer

Sign in to do the exercises and build your mastery up.

Sources

All the sources and licences

Part of the goals (43)

Discuss in the community