User:NevilleDNZ/GeSHi sandbox

This task requires the finding of the greatest common divisor of two integers.

Ada
Output: GCD of 100, 5 is 5 GCD of 5, 100 is 5 GCD of 7, 23 is 1

ALGOL 68
The output is: The gcd of       +33 and         +77 is         +11 The gcd of    +49865 and      +69811 is       +9973

Notes on performance
takes us about 2.87 usec

takes us about 2.47 usec

takes us about 2.86 usec

Notes on performance
takes us about 2.8 usec

takes us about 2.5 usec

Notes on performance
Output on 'Intel(R) Pentium(R) 4 CPU 1.50GHz' / Linux / Perl 5.8.8: Rate gcd_bin gcd_iter      gcd gcd_bin 321639/s       --     -12%     -20% gcd_iter 366890/s     14%       --      -9% gcd     401149/s      25%       9%       --

Recursive Euclid algorithm
Interpreter: Python 2.5

Notes on performance
takes us about 17 usec

takes us about 11 usec

takes us about 41 usec