Permutations vs Combinations

These two algorithms is a trial to create a system for permutations and combinations

it depends on a mathematical operation called factorial

I wish if David can add the operation to the expression editor

N! = 5! = 5 * 4 * 3 * 2 * 1

credit to this video series

https://www.youtube.com/watch?v=hJRXKq2GEo8&index=5&list=LL...

It helps find how many variations you can generate per group from a pool of selectable items.

I had my own version also

Attachments:

Permutations vs Combinations.gh, 21 KB

Replies to This Discussion

Permalink Reply by Mohamed Naeim on November 3, 2016 at 9:01pm

According to references

Permutation means arranging members of a set(a,b,c etc) into sequences (i.e. 3 keys each time), that means the order is important(ABC *= CBA).

But Combination means selection of unique possible sets in sequences(ABC = CBA), with order ignored.

this why it was possible to extract combinations from permutations without iterations, by only eliminating similar characters with matching characters.

That brings the question, whether it's possible to generate the combinations (56) without generating the whole possible (336) permutations, which already took around 8000 iterations

Permalink Reply by Mohamed Naeim on November 2, 2016 at 9:43pm

Update:

This option is super fast (unbelievably fast) just like Python speed, using Anemone (Fast Loop)

Attachments: