' Euclidean algorithm
' Finding Highest Common Divisor of two numbers: a < b
a = 15
b = 20
Do While b <> 0
r = a Mod b
a = b
b = r
Loop
MsgBox a