Utils & tests & recursion benchmark#9
Open
WhiteBlackGoose wants to merge 2 commits intoasc-community:masterfrom
Open
Utils & tests & recursion benchmark#9WhiteBlackGoose wants to merge 2 commits intoasc-community:masterfrom
WhiteBlackGoose wants to merge 2 commits intoasc-community:masterfrom
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Utils
_BenchmarkUtils is a project for some shared code that would be silly to duplicate between benchmarks. Feel free to add your classes once needed.
Tests
_Tests is a project for testing anything, be that utils or benchmarks. It should've been eventually created. Now we got it.
SequentialRandom
Is a struct that lets us to go over all numbers from 0 to the one given (exclusive) without duplicating and not in row (that is, pseudo-randomly). For example, it might be like this: 0 -> 3 -> 1 -> 2 -> 0 (it's circular)
Recursion benchmark
I tried to bench recursion over loops and took GCD as an example for it... but since the results appeared about the same, I ask for a review