-
Notifications
You must be signed in to change notification settings - Fork 19
Add benchmarks #12
Comments
That's a good idea! I assume you are talking about comparisons with other languages, yes? |
Woops, sorry for the late response, I thought I sent my ideas a while ago but indeed I must have had a network problem :'( Not necessarily comparisons with other languages, just to see how well the language perform in term of huge allocations, recursion, standard algorithms (fibonacci, factorial, AVL trees...). For the recursions test, a good one is the Ackermann Péter function because it's a non primitive recursive function, it means it can not be optimized by a compiler |
Oh, alright. Well, Factorial and Fibonacci are implemented so I'll work on recursion and other algorithms. Thanks for clearing that out and giving the idea 😁 |
Even though it's not very important, that's a good starting point to have few benchmarks just to know how good is the language! :D
The text was updated successfully, but these errors were encountered: