4 ms·
And even then, execution depends on your language and compiler. Write a recursive BFS in Haskell and it won’t blow up the stack.
by fire_lake 2y ago
And even then, execution depends on your language and compiler.
Write a recursive BFS in Haskell and it won’t blow up the stack.
- hyperbrainer 2y agoAny language with decent TCO won't do that. Python is the only big language that I can think of that doesn't do it.
- fire_lake 2y agoGuaranteed TCO is pretty rare unfortunately. Java, Go, JavaScript all lack it.
- hyperbrainer 2y agoActually, you are right.