How do you write a program to find the greatest common factor of a set of numbers?

Answer 1

You achieve this by putting all the values in container that allows linear traversal, such as an array. If the array has no numbers at all, the greatest common factor is 0. if the array has one number, the greatest common factor is that number. For arrays with two or more numbers, pop the last two numbers and calculate their greatest common factor, pushing the result back onto the array. Repeat until there is only one number left in the array. That number is the greatest common factor of all the original numbers.

To implement this, you will need a function that can return the greatest common factor of any two values. The following shows one way to implement this function:

unsigned greatest_common_factor (unsigned a, unsigned b)

{

while (a!=b)

a>b?a-=b:b-=a;

return a;

}