Hi,
I have item1 to item30 products.
I want to calculate combination for 30 products
like coin problems {HH,HT,TH,TT}
and do some calculation on that combination.
But it has 30! combination's.
how to find in minimum time and display??
Any algorithm or method to do it fast in minimum time??
Which means if you did billions of combinations/calculations per second you would never finish it in your lifetime (or anyone else's).
The question is not clear as to what you are to do.
Instead of item1, item2, item3 -- I've used the alphabet and some numerals.
Here is a list of your items:
[abcdefghijklmnopqrstuvwxyz1234]
How would you handle that case differently than this?
[bcdefghijklmnopqrstuvwxyz1234a]
30! is approximately 2^108 or approx. 10^32
You CAN work with those numbers.
I do not know what you are attempting to ask.
Could you explain it fully?
Hi,
I modified my problem definition......
Suppose I have 30 different numbers..
I want to calculate their sum by using combination.
But combination should not repleted
i.e.
E.g
for 4 numbers...
[ 10 20 30 40]
I want to do like without repetition
10
20
30
40
10+20
10+30
10+40
20+30
20+40
30+40
10+20+30
10+20+40
10+30+40
20+30+40
so how to calculate 30 numbers in this way..without repetition
How to do that??