Find limit of recursion: Difference between revisions

Find limit of recursion (view source)

39 bytes removed , 8 years ago

→‎{{header|ALGOL 68}}: Not so silly a task. Think outside Algol68 or just reserve your judgement for the comment page and state as an opinion.

Anonymous user

Revision as of 16:24, 10 August 2015 (view source) rosettacode>Brnikat m (→‎{{header\|ALGOL 68}}) ← Older edit		Revision as of 18:01, 10 August 2015 (view source) rosettacode>Paddy3118 (→‎{{header\|ALGOL 68}}: Not so silly a task. Think outside Algol68 or just reserve your judgement for the comment page and state as an opinion.) Newer edit →
Line 54: =={{header\|ALGOL 68}}== ~~This is a mind-bogglingly silly task.~~ The depth of recursion in Algol 68 proper is unlimited. Particular implementations will reach a limit, if only through exhaustion of storage and/or address space and/or time before power failure. If not time limited, the depth reached depends very much on what the recursive routine needs to store on the stack, including local variables if any. The simplest recursive Algol68 program is: <lang algol68>PROC recurse = VOID : recurse; recurse</lang> For what it's worth this one-liner running under Algol68 Genie and 64-bit Linux reaches a depth of 3535 with the shell's default stack size of 8Mbytes and 28672 when set to 64Mbytes,