News for hackers. Stuff that matters.
Re:Why is learning functional programming so damned hard? (2... by toast0 on Sunday August 15, 2021 @06:02PM (#28192953)
You can write the closed form in FP just as well as any other language.

Most FP languages will let you write a recursive form that won't blow the stack. In C, you'd need to used closed form or a loop if you value your stack.

Re:Why is learning functional programming so damned hard? (2... by AnimalMuppet on Sunday August 15, 2021 @09:25PM (#28194092)
How do you write the FP version that won't blow your stack? You can't just use TCO, can you? (Because of the two calls.)

And if you're using memoization, you could do that in C.

And, even a naive implementation wouldn't blow your stack, it would just melt your CPU into a puddle of slag.

Or am I missing something here?

Re:Why is learning functional programming so damned hard? (2... by toast0 on Monday August 16, 2021 @12:43AM (#28194998)
TCO works if you write it properly:

    fib(0) -> 0;
    fib(1) -> 1;
    fib(N) when is_integer(N), N >= 2
        -> fib(N, 2, fib(0) + fib(1), fib(1)).
    fib(N, N, Current, _Last) -> Current;
    fib(N, I, Current, Last) ->
        fib(N, I + 1, Current + Last, Current).
But if you write the same thing in C, it'll still blow your stack (of course, you can transform it into a loop), and you'll need to use bigints somehow, these numbers get big fast. It does use a lot of cpu though; takes not quite 10 seconds to run fib(1000000) on my Pentium G2020. Closed form is certainly faster, although I didn't benchmark it :D
Re:Why is learning functional programming so damned hard? (2... by toast0 on Monday August 16, 2021 @03:17AM (#28195700)
Too late to edit, but if you do

fib(N) when ... -> fib(N - 2, fib(0) + fib(1), fib(1)).

Then you can check for N = 0 to return Current, and do N - 1 in the iteration. One less value to pass in each recursion should make it faster, and it's less to think about.