This is an inelegant brute force approach:
my $num1 = 150;
my $num2 = 1000;
# set which is biggest and which smallest
my $max = ($num1 > $num2)? $num1 : $num2;
my $min = ($num1 < $num2)? $num1 : $num2;
for $divisor (reverse 0 .. $min) {
# fail unless our divisor divides evenly into $min
next if $min % $divisor;
# fail unless our divisor divides evenly into $max
next if $max % $divisor;
print "Largest common divisor is $divisor\n";
last;
}
This is O(n) in that the bigger the smaller number the longer this will take to run. For a more elegant approach use Euclid's recursive algorithm as suggested by larsen it is O(log $a * log $b) - ie so much more efficient it is not funny!:
print euclid(15000,1260);
sub euclid {
my( $a, $b ) = @_;
return ($b) ? euclid( $b, $a % $b ) : $a;
}
cheers
tachyon
s&&rsenoyhcatreve&&&s&n.+t&"$'$`$\"$\&"&ee&&y&srve&&d&&print
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.