Steven D'Aprano <steve at REMOVETHIScyber.com.au> writes: > It is a "mere implementation detail" that (for most computer systems, and > most programming languages) stack space is at a premium and a deeply > recursive function can run out of stack space while the heap still has > lots of free memory. Every serious FP language implementation optimizes tail calls and thus using recursion instead of iteration doesn't cost any stack space and it probably generates the exact same machine code.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4