I'm trying to solve the problem C-ORXOR. While reading the editorial of this problem there is a term used Which is Bitwise Exhaustive Search
According to the definition given in editorial For implementation, a useful way is bitwise exhaustive search, in which each combination of N−1 choices of whether or not to put the bars is regarded as N−1-digit binary integer, and corresponds to an integer between 0 (inclusive) and 2^(N−1)(exclusive).
Can Someone Please explain this Term with example !!!
here,suppose n=3 and (2^n)-1=7, now we can see,the binary bit representation are ,from 0-7 . 000 001 010 011 100 101 110 110
seems that, all possible combination occered. it's very useful ..