I just saw that with your set of 27 numbers process time needed 2 minutes and 33 seconds
and with the same data and using by its rules the same procedure I need less than 0.1 second !
Nothing to improve, as I wrote it's one of the two fastest procedure I know …
But have you any idea of what is a combinatorial sum ?
How many combinations for a choice of 2 elements to n elements of a set of n elements ?
It is purely logical and mathematical !
But I guess you do not even realize 'cause you would not write your last post ‼
OK, let's see !
For a set of 27 numbers, there are 134,217,700 combinations !
[ C(2,27) + C(3,27)+ … + C(25,27) + C(26,27) + 1 ]
For a set of 360 numbers, there are 213,599E91 (91 zeros follow 213,599 ‼)
yes, a bit more to calculate, but just a little ! And if you do not respect the process rules
(don't you read the warning message when you don't respect them ?!), it will take ages ‼
So you just have to reduce the set of numbers and respect the rules !
Of course if someone have a better faster algorithm, I wanna to test it !
Bookmarks