Need to find best algorithm that will find all possiblities from a list of
items that can combine up to any 3 items, ie,
 
list is: a b c d e f...up to 100 items
 
possible combinations would be:
 
a b c d e f
a+b c d+e f
a+f c+d+e b
 
and so forth... inside the combined items, sorting is not needed
 
any takers?  thanks!!!
 
Mel Bartels
Springfield Oregon