Skip to content
This repository has been archived by the owner on Jul 2, 2022. It is now read-only.

Add benchmarks #12

Open
SuperFola opened this issue Oct 29, 2019 · 3 comments
Open

Add benchmarks #12

SuperFola opened this issue Oct 29, 2019 · 3 comments

Comments

@SuperFola
Copy link

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

@Electrux
Copy link
Owner

Electrux commented Oct 29, 2019

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
Copy link
Author

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

@Electrux
Copy link
Owner

Electrux commented Dec 2, 2019

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 😁

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants