by Ricardo “Rudxain” Fernández Serrata
Calculates the Greatest/Highest Common Divisor/Factor using the optimized Euclidean Algorithm (the modulo-based, no subtraction), with a hack similar to destructuring assignment, to avoid temporary var.
This is guaranteed to return correct results regardless of input value or type (even if you bypass the Input-Dialogs), and it's guaranteed to halt (no infinite loop).
Some combinations of rational numbers will yield weird results due to rounding errors.
The subroutine is intended to be embedded in flows.
Rate and review within the app in the Community section.