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.
Also this entire article seems to be content marketing for crystal.
And, oh, btw, crystal isn't windows compatible.
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.
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.
It blows up the stack* and doesn't exercise much else.
(In a typical naive implementation in a procedural style as demonstrated here)