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

Re^2: No recursion depth limit?

by Old_Gray_Bear (Bishop)
on Sep 02, 2015 at 17:58 UTC ( #1140821=note: print w/replies, xml ) Need Help??


in reply to Re: No recursion depth limit?
in thread No recursion depth limit?

Recursion is a perfectly valid tool for certain types of problems, building tables of Recursive Numbers for example. (The Nth Fibonacci Number is useful in a wide variety of fields: Economics (dynamic optimization problems) and Cryptography (as a seed for pseudo-random number generators and primality testing), Genetics, the list goes on.

Recursion along with memo-ization allows clean, readable, maintainable code. Recursion has it's place in the tool-box of any professional programmer worthy of the name (and pay).

The fact that you can pose a problem large enough to cause your recursion depth to go to the point that you exhaust your computer's resources is an indicator that you need a better computer.

Or perhaps you are confusing recursion with 'fork-bomb'.

----
I Go Back to Sleep, Now.

OGB

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (3)
As of 2021-02-27 04:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?