Can someone give an example for finding greatest common divisor algorithm for more than two numbers?
I believe programming language doesn’t matter.
Can someone give an example for finding greatest common divisor algorithm for more than
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Can someone give an example for finding greatest common divisor algorithm for more than two numbers?
I believe programming language doesn’t matter.
Start with the first pair and get their GCD, then take the GCD of that result and the next number. The obvious optimization is you can stop if the running GCD ever reaches 1. I’m watching this one to see if there are any other optimizations. 🙂
Oh, and this can be easily parallelized since the operations are commutative/associative.