1/* Function using "Euclidian Algorithm" to recursively find the
2greatest common divisor/factor (GCD/GCF) of 2 positive numbers*/
3const gcf = function (small, large) {
4 let r = large % small;
5 if (r == 0)
6 return small;
7 else
8 return gcf(r, small);
9}