Skip to content

Conversation

@mraggi
Copy link

@mraggi mraggi commented Dec 6, 2017

Copied from the discreture library (which I maintain, and includes combinations among other things). Instead of iterating combinations in lexicographic order, this one iterates in the following order:
0 1 2
0 1 3
0 2 3
1 2 3
0 1 4
0 2 4
1 2 4
0 3 4
1 3 4
2 3 4

Anyway, this is faster on my machine. This is the default iterating order in discreture.

Not sure about the name, though. I called it "maximin" order, because the maximum is minimum possible, but I don't know what other name to come up with.

…combinations in a different order. This one is faster. Based on library discreture.
…combinations in a different order. This one is faster. Based on library discreture.
…combinations in a different order. This one is faster. Based on library discreture.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants