Read the algorithms already obeying you.

10 min · No prior experience · Programación

A 10-minute lesson: input, steps, and output, why order rules, the vagueness trap, and a mission to program your first algorithm.

What an algorithm really is, how it runs step by step, and why precision is everything.

The case

Your GPS, microwave, and feed don't think or improvise: they run exact steps in order. That is an algorithm.

In 10 minutes you'll see what they're made of: what goes in, what gets done, and what comes out, why order rules, and why vagueness breaks them.

What you will learn

  • Explain what an algorithm is without jargon
  • Tell input, ordered steps, and output apart
  • Spot vague steps that break an algorithm

Input + steps + output

With those three pieces, anyone — or any machine — repeats the result.

  1. Input

    What the algorithm starts with.

  2. Steps

    What to do, in what order.

  3. Output

    What comes out when executed.

  4. Trap

    No precision, no algorithm.

Frequently asked questions

Does an algorithm have to live inside a computer?

No: a recipe on paper is already an algorithm. The machine can be an oven… or you.

Does the order of steps really matter?

Yes: each step works on the state left by the previous one. Change the order, change the result.

Test yourself: Lightning test: algorithm or hunch?

What is an algorithm?

Correct answer: A finite sequence of precise steps turning an input into an output.

Finite, precise, and ordered: with that, anyone — person or machine — repeats the result.

Your GPS says “turn where you see the shop” and you get lost. What failed?

Correct answer: Precision: “the shop” isn't an executable instruction.

“The shop” leaves the call to the driver: a machine can't execute that. Precision in, destination out.

Does the order of the steps matter?

Correct answer: Yes: heating before inserting the plate heats nothing.

Order is part of the algorithm: each step works on the state the previous one left.

The pocket rule — Input (with what) + ordered steps (what and when) + output (what comes out). If precision is missing, there's no algorithm.

What you take away

Write mini-algorithms with input, ordered steps, and output, and detect where they break.

Keep learning

Open the interactive lesson →