in reply to John Guttag's book - 2nd exercise. My attempt in Perl.

Well a generic solution is to loop over all variables and check against a $max which is initially undef and grows whenever a bigger odd variable is encountered.

You may want to store them in a hash to keep the names associated (are hashes allowed? )

  • Comment on Re: John Guttag's book - 2nd exercise. My attempt in Perl.

Replies are listed 'Best First'.
Re^2: John Guttag's book - 2nd exercise. My attempt in Perl.
by marinersk (Priest) on May 21, 2017 at 04:30 UTC

    Coded as such:

    use strict;
use warnings;

# Initialize
my ($x, $y, $z) = (-11,-13,4);
my $maxodd;        # Intentionally left as undef

# Check $x (though $maxodd will be undef, write it consistently in cas
+e code is revectored later)
if ($x % 2) {
    if ( (!defined $maxodd) || ( (defined $maxodd) && ($x > $maxodd) )
+ ) {
        $maxodd = $x;
    }
}
# Check $y
if ($y % 2) {
    if ( (!defined $maxodd) || ( (defined $maxodd) && ($y > $maxodd) )
+ ) {
        $maxodd = $y;
    }
}
# Check $z
if ($z % 2) {
    if ( (!defined $maxodd) || ( (defined $maxodd) && ($z > $maxodd) )
+ ) {
        $maxodd = $z;
    }
}
# Report results
if (!defined $maxodd) {
    print "All are even numbers\n";
} else {
    print "$maxodd is the greatest odd number\n";
}

# Fini
exit;

    [download]

    This screams for the use of a subroutine, though I suspect the author isn't at that point in the book yet.

[reply]
[d/l]

In Section Seekers of Perl Wisdom