in reply to Re^4: Algorithm to convert combinations to bitstring (size)
in thread Algorithm to convert combinations to bitstring

That was my alternative (in an update) if K is small (or near N). That uses log2( N**K ) bits.

But what I described above is using base 2. It uses only N bits no matter how large (or small) K is, and the translation doesn't depend on K either. It can describe any subset of your superset, not just subsets of size K.

- tye        

  • Comment on Re^5: Algorithm to convert combinations to bitstring (size)

In Section Seekers of Perl Wisdom