A recursive perl script to find the greatest common denominator of two integers.

gcd-recursion.pl

#!/usr/bin/perl -w
use strict;
 
sub gcd {
  my ($m, $n) = @_;
  if ($n == 0) {
    return $m;
  }
 
  return gcd($n, $m % $n);
}
 
sub main {
    gcd($ARGV[0], $ARGV[1]);
}
main();