LabVIEW
gcd of more than 2 numbers
one way would be to do a factorization of all numbers.
After having a list of all prime factors you only have to look for common factors of all numbers 🙂
For anyone coming across this now, this is a much more performant and easier to understand solution:
It recursively uses the shipping GCD VI instead of using the prime factor method. (I suspect that the GCD VI didn't exist back in 2006 when this post was originally made.) VI is attached.
@croohcifer wrote:
For anyone coming across this now, this is a much more performant and easier to understand solution:
(Be careful with the wording, this has nothing to do with recursion. I am also not sure what "much more performant" means. Do you have relevant benchmarks?)
In any case. Your version still seems overly complicated. You only need exactly one instance of GCD.
Here is equivalent, but arguably simpler code. 😄
Thanks for calling out my sloppy use of "recursion" and for providing the simplified code! Yes, I did benchmark it per Darren's brainless LabVIEW benchmarking best practices to be multiple orders of magnitude faster than the original solution. Here's the snippet for those looking:
We could make a recursive version, if that is a requirent or goal of some sort (homework?).
We could make a VI that calculates the GCD of a number and an array. If the array >1 element, strip a number and call the VI.
Altough that would be pointless, overcomplicated and wasteful, it will be recursion. 
.
Search LabVIEW like a graph!
@croohcifer wrote:
Yes, I did benchmark it per Darren's brainless LabVIEW benchmarking best practices to be multiple orders of magnitude faster than the original solution.
Most likely things could be improved even further by taking advantage of the fact that we are dealing with an array. For example if we would sort the array in a certain way first and then use code tailored to that fact. I have not tried.
