You may set the initial two numbers by clicking on the sides of the bars.
The Euclid's algorithm so implemented will reveal you in a graphical manner its steps, until the greatest common divider of the two numbers is found.

EUCLID's ALGORITHM

ai = ai-2 - qi-1ai-1


Does it work??
Comments are welcome !