4 ms·
Why is Fibonacci the standard performance test? I want to know how it runs on complex objects with complex computations. Also this entire article seems to be c
by ryanx435 8y ago
Why is Fibonacci the standard performance test? I want to know how it runs on complex objects with complex computations.
Also this entire article seems to be content marketing for crystal.
And, oh, btw, crystal isn't windows compatible.
- fgimian 8y agoFor what it's worth, I have zero association with Crystal, but just happen feel that it appeals to me the most. You can see this on my GitHub too, all projects up until a week ago were Python. And I chose Fibonacci as a fun little test which I even stated in the post. It should be obvious that this is not an overall indicator of performance for all use cases. For many of us, Windows isn't our target platform so the Windows compatibility isn't a deal breaker. I understand that this is a big problem for many though and there is evidence that the Crystal team are on it; see https://github.com/crystal-lang/crystal/issues/5430 https://github.com/crystal-lang/crystal/issues/5430. Please don't take the post too seriously, it's not intended to be and clearly everyone will have different preferences and tastes as is the case with anything in life.
- deleted 8y ago[deleted]
- jjtheblunt 8y agoIf it runs in Ubuntu it runs in WSL, yes?
- emmelaich 8y agoYes, Fibonacci is a poor benchmark. It blows up the stack* and doesn't exercise much else. (In a typical naive implementation in a procedural style as demonstrated here)
- ChrisRackauckas 8y agoFibonacci is an easy problem to know that you implemented the recursive form correctly (easy to check the answer), and the recursion is a very simple way to test the speed of function calls. So it's a very reproducible way to test the speed of some of the internals.