Small algorithm needed...

saad · science forum beginner Joined: 01 Feb 2006 Posts: 11

I am working on a small private project in c++, and need following
algorithm on the fly.
I need to be able to generate a list of all possible
combinations for a set of numbers. k = amount of spaces
t = highest number
l = lowest number

I need a function that will give all possible combonations of k spaces
with numbers from l to t ex. l = 0 , t = 1, with k = fixed interger,e.g
5 here.

00000, 00010, --snip-- , 11111
so numbers will be able to repeat them selves.

Like I said before I need ALL POSSIBLE COMBANATIONS and no repeateing
combanations in the list.

It would be good if code is in C++
thanks

Matthias Klaey · science forum beginner Joined: 22 Oct 2005 Posts: 3

saad.qaisar@gmail.com wrote:

saad · science forum beginner Joined: 01 Feb 2006 Posts: 11

its like this:
In my approach to fill in the spaces, if i decide to have two ones say
1 and 1^ where 1=1^, and three zeros, then i need to generate all
permutations of these without considering the case of 101^00 and
1^0100 as two seperate cases. One shortcut is to check their decimal
val, if same as some already existing, just consider them once. Though
i was looking for a bit smarter way...
Matthias Klaey wrote:

Proginoskes · science forum Guru Joined: 29 Apr 2005 Posts: 2593

saad.qaisar@gmail.com wrote:

Google