by Ricardo Fernández Serrata
Computes the Greatest/Highest Common Divisor/Factor of an array of integers using the Euclidean (NOT Euclid's) Algorithm.
You can remove sort() overhead if the input is already sorted. If you want to find GCD without sorting, apply the Euclidean Algorithm to each pair of numbers in the array, padded with 0 if the length is an Odd number
Reviews and ratings can be submitted in the app.