Mehdi, the poster wanted to simulate a real life coin toss with a coin that lands on heads 1/3 of the time and tails 2/3 of the time, not display the possible permutations of a certain number of tosses.

Hello Spivonious,
using combinations give you all the possible answers
(I just wanted to have all the possible answers so I used combinations)

--------------------------------------------
Mehdi.:)

It shouldn't be that difficult, I think.
Just create all the sequences first, eg:

#define N (10)
nh = N * 3 / 10;
np = N - nh;
char coins[N];
for (int i = 0;i < N;i++)
  (i < nh) ? coins[i] = 'h' : coins[i] = 't';

Then swap randomly:
#define MAXSWAP 10
for (int i = 0;i < MAXSWAP;i++)
{
  int top = <randomvalue>;
  int bot = <randomvalue>;
  swap(coins[top], coins[bot]);
}

Hope it does the trick.

KOkon.

Hello,
this algorithm you told is easy but if I were you I would prefer using
Combinations instead of working on random values,
Combinations can assure us we have all the possible answers correctly.


--------------------------------------------
Mehdi.:)