Beefy Boxes and Bandwidth Generously Provided by pair Networks DiBona
Don't ask to ask, just ask
 
PerlMonks  

Re^3: Algorithm to convert combinations to bitstring (size)

by tye (Sage)
on Oct 18, 2006 at 14:38 UTC ( [id://579167]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


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

26 bits isn't very many so A=2**0=1, B=2**1=2, ..., Z=2**25=0x2000000. ABZ=0x2000003.

- tye        

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

Replies are listed 'Best First'.
Re^4: Algorithm to convert combinations to bitstring (size)
by Limbic~Region (Chancellor) on Oct 18, 2006 at 14:44 UTC
    tye,
    Ok, I think what you are saying is count in base-N even though you don't need all the bits? If that's the case then yes, it may make things easier and the extra space shouldn't be that much more.

    Cheers - L~R

[reply]

      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        

[reply]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://579167]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    • hippo‥ epoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    • erzuuli‥ Anonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.