in reply to Re^5: Speeding permutation counting
in thread Speeding permutation counting
What the OP is calculating is the number of bit pairing (4 values) for each combination of 2 strings.
Eg: Assuming 32-bit strings, typical values might be:
strings: '00' '01' '10' '11' 1 & 2 10 5 12 15 1 & 3 2 17 7 6 1 & 4 1 & 5 2 & 3 ....
So the OP wants 4 numbers per pairing of strings, regardless of the number of bits.
What you would be calculating is 4 numbers per bit position, regardless of the number of strings.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^7: Speeding permutation counting
by Limbic~Region (Chancellor) on Jul 20, 2007 at 00:58 UTC |