Representing a very large array of bits in little memory
        Posted  
        
            by 
                user614624
            
        on Stack Overflow
        
        See other posts from Stack Overflow
        
            or by user614624
        
        
        
        Published on 2011-02-12T23:19:23Z
        Indexed on 
            2011/02/12
            23:25 UTC
        
        
        Read the original article
        Hit count: 239
        
Hello,
I would like to represent a structure containing 250 M states(1 bit each) somehow into as less memory as possible (100 k maximum). The operations on it are set/get. I cold not say that it's dense or sparse, it may vary. The language I want to use is C.
I looked at other threads here to find something suitable also. A probabilistic structure like Bloom filter for example would not fit because of the possible false answers.
Any suggestions please?
© Stack Overflow or respective owner