Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Combinations benchmark #76

Open
stefanv opened this issue Jun 1, 2015 · 1 comment
Open

Combinations benchmark #76

stefanv opened this issue Jun 1, 2015 · 1 comment

Comments

@stefanv
Copy link
Contributor

stefanv commented Jun 1, 2015

https://gist.github.com/stefanv/954d21cb13f1aad55b0f

For the three methods implemented, I see:

1 loops, best of 3: 1.52 s per loop
10 loops, best of 3: 153 ms per loop
10 loops, best of 3: 148 ms per loop

If you are willing to get your outputs as lists instead of arrays, it's quite a bit quicker still.

@kellieotto
Copy link
Member

A more likely use scenario is with the two groups roughly the same size. I changed it to N=20, k=10 and got

1 loops, best of 3: 8.09 s per loop
1 loops, best of 3: 791 ms per loop
1 loops, best of 3: 885 ms per loop

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

No branches or pull requests

2 participants