How do i generate all possible subsets of an binary string?

Posted by mr.bio on Stack Overflow See other posts from Stack Overflow or by mr.bio
Published on 2010-03-31T22:44:09Z Indexed on 2010/03/31 22:53 UTC
Read the original article Hit count: 356

Filed under:
|
|
|

Hi.. i have a problem, that i don't know how to solve it.

i have a binary string and i want to generate all possible binary substrings.

Example :

input : 10111
output: 10000, 10100,00111,00001,10110 ...

How can i do this , fast AND Smart ?

© Stack Overflow or respective owner

Related posts about c++

Related posts about algorithm