2 ms·
Yeah, I'm aware that recursive way is not the fastest way to compute fibonacci, but it still serves as a good way to simulate CPU bound work. When it comes to t
by xqb64 3y ago
Yeah, I'm aware that recursive way is not the fastest way to compute fibonacci, but it still serves as a good way to simulate CPU bound work. When it comes to the comparison to other, in this case, virtual machines, I've compared my language to Python (since they're conceptually similar), and I'm beating Python in this particular benchmark (18s vs 28s).
- DemocracyFTW2 3y agoOK I'm not saying that recursive Fibonacci is a bad way to test your language, but * it's not a very good one either, because a sensible implementation won't be recursive in many current languages * even if it's faster it's just 1 case so it doesn't speak for the language as a a hole set of possibilities; it's a bit as though the Python people were all like, hey look, our hello world runs 1.6 times faster than when using language Y!! It's just not convincing. * your goal may be to beat other languages for this particular use case, then that's fine, most people won't be interested in your language if that's the case, but of course you do you