Euler's GCD Algorithm Example

[Everett Hildenbrandt]

Provide an example using Euler's GCD algorithm.

From @grosu:

function gcd(a, b)
    while b ≠ 0
       t := b; 
       b := a mod b; 
       a := t; 
    return a;