Try:
Algorithm 0 lines
Terminal
Process
Decision
I / O
Call
Prep
Connector

No diagram yet

Write your algorithm on the left or pick an example above

Keyword Reference

Structure

STARTBegin the algorithm — rounded terminal node
END / STOPTerminate the algorithm — rounded terminal node

Input / Output

INPUT xRead a value — parallelogram shape
OUTPUT xWrite / print a value — parallelogram shape
RETURN xReturn from function — same as OUTPUT

Conditionals

IF c THENCondition in a diamond. Must end with ENDIF
ELSEOptional false branch inside the IF block
ENDIFCloses an IF block

Loops

WHILE c DOCondition diamond, body loops back. Close with ENDWHILE
ENDWHILECloses a WHILE block
FOR x DOSame as WHILE — close with ENDFOR
ENDFORCloses a FOR block
DOStart a DO...WHILE loop body. Close with WHILE c
WHILE cEnd of DO...WHILE — condition checked after body

Functions & Subroutines

CALL nameCall a subroutine — double-bar rectangle shape
FUNCTION nameSame as CALL — double-bar rectangle

Switch / Case

SWITCH xStart a switch block on variable x
CASE vBranch for value v — diamond with label
DEFAULTFallback branch
ENDSWITCHCloses the switch block

Other shapes

PREP xPreparation / initialization — hexagon shape
DISPLAY xScreen output — display shape (pentagon)
CONNECTOR nFlow connector — small circle with label
BREAKExit current loop — red terminal-style node
CONTINUESkip to next iteration — amber node
COMMENT textAnnotation — dashed box off to the side

Everything else

any textLines without a keyword become rectangular Process nodes