in reply to Re^3: Speeding permutation counting
in thread Speeding permutation counting
Oh. I see what you mean.
Eg. If of 1000 strings, 500 have a 1 in bit 0, then you know that in the 500500 2-way compares, you would get '00' & '11' 1/4 of the time each and '01' or '10' 1/2 of the time.
But I don't see a way of determining how many '10's relative to the '01's?
And no way to determine which pairs of strings render which values for any given bit, nor a count of the four possible values for any given pair of strings?
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^5: Speeding permutation counting
by Limbic~Region (Chancellor) on Jul 20, 2007 at 00:08 UTC | |
by BrowserUk (Patriarch) on Jul 20, 2007 at 00:19 UTC | |
by Limbic~Region (Chancellor) on Jul 20, 2007 at 00:58 UTC |