Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: Finding the max()/min()

by pg (Canon)
on Nov 11, 2004 at 03:25 UTC ( #406898=note: print w/ replies, xml ) Need Help??


in reply to Finding the max()/min()

A recursive solution for a list of numbers: (the idea to get max for a list is originally gotten from elusion's post)

use strict; use warnings; print max(1.23,2.6,55.1,1.11,4,5); print min(1.23,2.6,55.1,1.11,4,5); sub max { splice(@_, ($_[0] > $_[1]) ? 1 : 0, 1); return ($#_ == 0) ? $_[0] : max(@_); } sub min { splice(@_, ($_[0] > $_[1]) ? 0 : 1, 1); return ($#_ == 0) ? $_[0] : min(@_); }


Comment on Re: Finding the max()/min()
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://406898]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (12)
As of 2015-07-03 18:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (55 votes), past polls