3 ms·
> I do not think that the naive recursive Fibonacci is a useful benchmark in any way though, it's a way too pessimized implementation. probably, but I would st
by vmchale 8y ago
> I do not think that the naive recursive Fibonacci is a useful benchmark in any way though, it's a way too pessimized implementation.
probably, but I would still like to see more benchmarks that use recursion. It's a fundamental technique from functional programming and so few benchmarks bother with it at all.