|
Posted by all_my_trash on 07/26/06 10:47
Hello!
I'm trying to write an algorithm which can fill an array with all the
possible combinations of r out of n, without repetition (maximum
combinations = n!/(r!(n-r)!))
However, my mathematical skills are insufficient - does anybody have
such an algorithm for sharing?
Regards,
OMykle
Navigation:
[Reply to this message]
|