C++ Exercise 11 - Euclidean Algorithm for finding the GCF

I show how to write a program to find the Greatest Common Factor using the Euclidean Algorithm. If you haven't watched my math video on the Euclidean Algorithm yet I highly recommend watching it.

Math Euclidean Algorithm for the GCF
http://www.youtube.com/watch?v=YRojnL00o8c

Category:

Education

Tags:

• c++
• C++
• plus
• program
• programming
• exercise
• math
• euclid
• euclidean
• algorithm
• algebra
• trig
• zach
• niemann
• zniemann
• hendrix5045

[olawraia]

you write an awful code just improve it 

[hendrix5045]

@olawraia , I'll get right on that as soon as you learn some grammar.

[Yondaimeku]

@hendrix5045 I wouldn't call it awful, everyone has their ways of doing something. I think he's just trying to say the same results could have been achieved with less coding.

[hendrix5045]

@Yondaimeku , Instead of being condescending why don't you just explain how it could be better.

[arHHco]

@Yondaimeku simply because u unnecessarily called those strange variables divisor dividend, when you could simply do ur code in few lines like

while(b>0){ c=a%b; a=b; b=c; } cout<< a;

[hendrix5045]

@arHHco , strange variables? Naming variables what they actually are is programming etiquette 101. I would argue that using random letters as variables would make it much more complicated and harder to understand. That's the point of giving variables names you can relate to. However, this code was written a long time ago and I could make it more efficient, but that would not entail changing the variable names.

[ordep050]

Thanks man!



[olawraia]

uiy]

[frwings48]

thanks man :D

[hendrix5045]

@xiAresx , No it wont. You could send me the math problem you have though and I could do it :)