Algorithms

Solve classic problems using logic and loops

Prime number check

Check if a number is prime using a divisor loop. Try the complexity analyzer after running it.

N = 7
DIV = 2
IS_PRIME = 1

WHILE DIV < N
  IF N % DIV = 0 THEN
    IS_PRIME = 0
  END
  DIV = DIV + 1
END

IF IS_PRIME = 1 THEN
  PRINT "Prime"
ELSE
  PRINT "Not Prime"
END

Fibonacci sequence

Generate the first N Fibonacci numbers.

N = 5
A = 0
B = 1
COUNT = 0

WHILE COUNT < N
  PRINT A
  TEMP = A + B
  A = B
  B = TEMP
  COUNT = COUNT + 1
END

Greatest Common Divisor (GCD)

Find the GCD of two numbers using subtraction.

A = 12
B = 8

WHILE A != B
  IF A > B THEN
    A = A - B
  ELSE
    B = B - A
  END
END

PRINT A

Find maximum (manual)

Simulate finding the maximum from values.

A = 3
B = 7
C = 5

MAX = A

IF B > MAX THEN
  MAX = B
END

IF C > MAX THEN
  MAX = C
END

PRINT MAX