Our Highest Common Factor code in Perl.
List Highest Common Factor Class File:
package HCF;
BEGIN {
require Exporter;
# for the sake of standard
our $VERSION = 2016.12;
# Inherit from exporter to export functions and variables
our @ISA = qw(Exporter);
# Functions and variables to be exported by default
our @EXPORT_OK = qw(getHCF);
}
use warnings;
use strict;
my ($index, $all_round_factor, $calc_result);
my (@set_of_numbers, @common_factors);
# simulate an object construct
# takes one argument -- besides its package name;
# reference to set whose HCF is to found
sub new {
no warnings;
my $this = shift;
my $parameters = {@_};
bless $parameters, $this;
$this->_init(@_);
return $this;
}
# Simulate a constructor
sub _init {
my $self = shift;
my $tmp = shift;
@common_factors = ();
@set_of_numbers = @{$tmp};
# STEP 1:
@set_of_numbers = sort {$a <=> $b} @set_of_numbers;
$index = 2;
$all_round_factor = 0; # boolean state flag
$calc_result = 1;
}
# does the grunt work
# takes no arguments but requires '@set_of_numbers' to be set
sub findHCFFactors {
while ($index <= $set_of_numbers[0]) {
# Check for factors common to every member of 'set_of_numbers'
$all_round_factor = 1;
# STEP 2:
for (0 .. $#set_of_numbers) {
$all_round_factor = 0 if !($all_round_factor && $set_of_numbers[$_] % $index == 0);
}
# STEP 3:
# Divide every member of 'set_of_numbers by each common factor
if ($all_round_factor) {
$set_of_numbers[$_] /= $index for 0 .. $#set_of_numbers;
push @common_factors, $index;
# STEP 4:
return findHCFFactors();
}
$index++;
}
return;
}
# Returns a scalar value of the HCF
sub getHCF {
findHCFFactors();
#iterate through and retrieve members
for (@common_factors) {
$calc_result *= $_;
}
return $calc_result;
}
1;Main Class:
#!/usr/bin/perl;
use strict;
use warnings;
use HCF;
# Useful variables
my $answer;
my @set;
# Use the HCF module/class
@set = (20, 30, 40);
my $hcf = HCF->new(\@set);
$answer = $hcf->getHCF();
print ("The H.C.F. of ", join(", ", @set), " is $answer\n");
print "\n\n";Try it out!
Elegance (0.0)
