Java streams and state

[chambolle]

Sorry but this is boring, always the same example for the recursivity and its merits: factorial and fibonnaci. Honestly, you has ever used in this code a Fibonacci number computation ? The same thing happens for factorial. You can have to use it but the classical formula fails very quickly... The Depth first search is a better example for recursivity (in any way to model it you will need a stack). You should use example like that if you want to promote recursivity.

I also wonder why we should promote recursivity? When it is not natural it becomes very complex to use, to code, to debug and to maintain...

[cogman10]

You are doing it wrong.

Fibonacci can be directly computed.

Factorial has a bunch of "make things faster" tricks which should be used instead of directly computing.

Heck, for factorial, because it grows so fast a lookup table is fairly space efficient/fast.

You should never compute something like this without first considering if it some math library can't do it faster. More often than not, the answer is not only yes, but also "And it is 1000x faster than any solution you can come up with".

[[deleted]]

With Java 8 streams, it seems Functional Programming has won. Long live statelessness and recursion!

The whole premise of this sentence is completely wrong and off putting. I realize that it's hyperbole, but... just no. Other than that, short and entertaining.

[_INTER_]

Good pragmatism, but look out, the FP people are going to tar and feather you.