Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Re^4: Finding the max()/min()

by Aristotle (Chancellor)
on Dec 19, 2004 at 05:45 UTC ( #415956=note: print w/ replies, xml ) Need Help??

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

That's all well and nice, but my goal was to use an approach which directly generalizes from the specific case of a two element list. As you'll also notice I used the value returned from the recursive call twice, it's both kind of difficult and beside the point to work on tail recursion here. Noone in their right mind writes a recursive max() outside a functional language anyway, and in a pure functional language I'd just write max( @l ) twice and let the compiler/VM figure out that the result need only be calculated once.

In any case, your new approach is just a variation on what was already posted in the parent node — no need for repetition…

Makeshifts last the longest.

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

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (3)
As of 2015-11-30 04:03 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (757 votes), past polls