How do I generate all the submasks for a given mask?
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
How do I generate all the submasks for a given mask?
Name |
---|
Auto comment: topic has been updated by skpro19 (previous revision, new revision, compare).
The easiest way I know is:
If you want 0 as a submask:
You have to know if we want to do something with the submasks of every mask till 2^N the time complexity will be O(3^N) not O(4^N).
Thanks man! It was really helpful.
Can somebody explain please, why is it 3^n ?
$$$3^n=\sum_{k=0}^{n} \binom{n}{k}2^k$$$ by binomial expansion. $$$2^k$$$ is number of submasks if we have $$$k$$$ ones. $$$\binom{n}{k}$$$ is number of masks with $$$k$$$ ones.
Oh, thanks. Ive just read it here https://cp-algorithms.com/algebra/all-submasks.html :)
Better way to think about it is, if you have N items, then each item being considered is either 1. not in the mask, 2. in the mask but not in the submask, 3. in the submask. So 3^N.
Time complexity = O(3^n) if we are generating all submasks for all 2^n numbers for the n bit number else for a particular number having k out of n bits set complexity is O(2^k)