uSE AnY pRogrAmMinG L@ngu@g3 yOu liKe.

1nTervi3weRs Do N0t CarE aBouT tHe L@nGuAge.

Fuck you. Stop asking time complexity or space complexity of functional code. No one fucking knows.

@Demolishun functional style

@iiii
Actual functional languages do tail call optimization. Tail-recursive functions are compiled as loops there.

In such functional languages, you are allowed to write a recursive solution as a tail-recursive function. You don't need to convert it to a loop by hand.
And sometimes a recursive solution is easier to read and understand.

@iiii I'm very interested in how that works. Can you show me an example
with the classical filesystem traversal problem?

How can you not get time complexity from functional code?

@iiii https://rosettacode.org/wiki/...
Or pick any other language example with a recursive walk function actually visible.

@iiii thanks didn't know what you meant with fake stack but makes sense now.
I was thinking along the same lines with building an itterable datastructure.

@iiii good luck trying to parse languages without using recursion.

Doable? Maybe.
Maintainable? No way.

@iiii which are recursive.. if you are building a parser.