This is the area where I post interesting algorithms that I learn about. Most of these come from JRPC (James Ruse Programming Club). 
Zone4: Algorithms
Euclid's Algorithm for GCD
gcd.pseudo (pseudocode) GCD(a,b): if b == 0: return a else: return GCD(b,a%b)
gcd.py (source code) def GCD(a,b):
output (stdout) enter first number 24012 #inputenter second number 48096 #inputcalling GCD(48096,24012) calling GCD(24012,72) calling GCD(72,36) calling GCD(36,0) b is 0 so we return a:36 GCD(48096,24012) = 36

12 of 2