Your skill will accomplishwhat the force of many cannot PerlMonks

### Re^3: Finding the max()/min()

by cLive ;-) (Prior)
 on Nov 11, 2004 at 23:55 UTC ( #407227=note: print w/replies, xml ) Need Help??

in reply to Re^2: Finding the max()/min()
in thread Finding the max()/min()

Ahh, good point ;-)

Serves me right for trying to be creative on a Windows box sans Perl :)

cLive ;-)

Replies are listed 'Best First'.
Re^4: Finding the max()/min()
by dvo (Initiate) on Nov 05, 2011 at 08:33 UTC
This is the variant I found most straightforward to use:
use List::Util qw[min max]; \$m = max(1,2);
Re^4: Finding the max()/min()
by fnicholas (Initiate) on Jan 26, 2012 at 15:11 UTC
Here you go:

This is how one can find a maximum number in an array iteratively and recursively in Perl

#!/usr/bin/perl my (@setOfnumbers); @setOfnumbers = ( 9, 7, 90, 3, 8, 412, 67, 2, 45, 53, 1, 3,89 ); print "Finding maximum number iteratively ", getMaximumNumber(@setOfnumbers) , "\n"; print "Finding maximum number recursively ", findMaximumNumber(@setOfnumbers) , "\n"; #Finding maximum number iteratively sub getMaximumNumber{ my (\$maximumNumber); \$maximumNumber = @_[0]; foreach(@_){ if (\$_ > \$maximumNumber){ \$maximumNumber = \$_; } } return \$maximumNumber; } #Finding maximum number recursively sub findMaximumNumber{ my (\$maximumNumber); if (@_ == 1){ \$maximumNumber = shift(@_); return \$maximumNumber; } else{ \$maximumNumber = shift(@_); return (findMaximumNumber(@_) > \$maximumNumber) ? findMaximumNumber(@_) : \$maximumNumber; } }

Create A New User
Node Status?
node history
Node Type: note [id://407227]
help
Chatterbox?
and cookies bake in the oven...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (3)
As of 2018-04-26 01:07 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
My travels bear the most uncanny semblance to ...

Results (94 votes). Check out past polls.

Notices?