Add benchmarks

[SuperFola]

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

[Chirag-Khandelwal]

That's a good idea! I assume you are talking about comparisons with other languages, yes?
I think I'll do that, but perhaps now might not be the best time as the language is not quite optimized yet. I'd like to hear what you have in mind though! Any insight/ideas? 😄

[SuperFola]

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

[Chirag-Khandelwal]

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 😁