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?
In reply to Re^4: Speeding permutation counting
by BrowserUk
in thread Speeding permutation counting
by albert
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |