Math-sy question

[Cheetah Designs]

I have a set of numbers {0, 1, 2, 3, ..., 49}

How do I get every every possible subset of numbers where the set length is between 5->10?

So these will all be included:

{0, 1, 2, 3, 4}
{5, 7, 20, 25, 49}
{4, 7, 12, 48, 49}

I'm looking for the general trail of though of the method/algorithm you use.

 

[Cheetah Designs]

Wait are you looking for the number of combinations or are you looking for pseudocode to actually generate them?

I was looking for the pseudocode.

 

[Cheetah Designs]

Im not bothered about running time, but I want it to be generic so that I can pass the algorithm four parameters.

- the minimum number
- the maximum number
- set min length
- set max length