Scratch and algorithmic thinking · Lesson
Update the current maximum while scanning a sequence of inputs.
To find the maximum of a sequence, keep a current state. The first value initializes max; each later value may replace it.
max=first; FOR each value IF value>max THEN max=value
This is a starter map for the lesson concept. You can move and edit nodes, add new ones and create your own connections. Changes stay on this device and do not affect mastery assessment.
Double-click a node to edit it. Drag nodes and add the connections that help you remember the concept.
Press Run and carefully observe block order, the Stage and variable state. The Scratch environment intentionally remains in English.
Find the maximum of N values using the equivalent max < current form to decide when to update.
Some key blocks are detached and shown beside the program. Drag them into the correct positions and also check values or operators that may be deliberately wrong.
Progress: 0 / 5 · correct: 0
The mental model in this lesson does not belong to Scratch: it describes a programming concept. Later the same exercise can be represented as a flowchart and then as a C program while keeping the same test cases.
ConceptStep separates what is required from what is recommended or useful as reinforcement. Only required prerequisites block your progress.
Relationships: solid line = required · dashed line = recommended · dotted line = reinforcement.