hi,
posting my (naive) implementation of the "Euclidean"[*] method to calculate the
gcd, in case it'll be of use to others. googling for "gcd" (and spelled out) on
the news.povray site, surprising to me, got zero results.
[*] <https://en.wikipedia.org/wiki/Greatest_common_divisor#Euclidean_algorithm>
regards, jr.
Post a reply to this message
Attachments:
Download 'gcd.pov.txt' (1 KB)
|