**Problem**

Given a positive integer n, count the total number of set bits in binary representation of all numbers from 1 to n.

**Examples**

Input: n = 3 Output: 4 Input: n = 6 Output: 9 Input: n = 7 Output: 12 Input: n = 8 Output: 13

Solutions

**Method 1 - Simple - Count bits in individual number upto n**

A simple solution is to run a loop from 1 to n and sum the count of set bits in all numbers from 1 to n.

unsigned int countSetBits(unsigned int n) { int bitCount = 0; // initialize the result for(int i = 1; i <= n; i++) bitCount += countSetBitsUtil(i); return bitCount; } // A utility function to count set bits in a number x unsigned int countSetBitsUtil(unsigned int x) { if (x <= 0) return 0; return (x %2 == 0? 0: 1) + countSetBitsUtil (x/2); }

Of course countSetBitsUtil implementation can change. You can refer - how to count number of bits set in the integer.

Time Complexity: O(nLogn)

**Method 2 (Tricky)**

If the input number is of the form 2^b -1 e.g., 1,3,7,15.. etc, the number of set bits is b * 2^(b-1). This is because for all the numbers 0 to (2^b)-1, if you complement and flip the list you end up with the same list (half the bits are on, half off).

If the number does not have all set bits, then some position m is the position of leftmost set bit. The number of set bits in that position is n – (1 << m) + 1. The remaining set bits are in two parts:

1) The bits in the (m-1) positions down to the point where the leftmost bit becomes 0, and

2) The 2^(m-1) numbers below that point, which is the closed form above.

An easy way to look at it is to consider the number 6:

0|0 0 0|0 1 0|1 0 0|1 1 -|– 1|0 0 1|0 1 1|1 0The leftmost set bit is in position 2 (positions are considered starting from 0). If we mask that off what remains is 2 (the "1 0" in the right part of the last row.) So the number of bits in the 2nd position (the lower left box) is 3 (that is, 2 + 1). The set bits from 0-3 (the upper right box above) is 2*2^(2-1) = 4. The box in the lower right is the remaining bits we haven't yet counted, and is the number of set bits for all the numbers up to 2 (the value of the last entry in the lower right box) which can be figured recursively.

unsigned int getLeftmostBit (int n) { int m = 0; while (n > 1) { n = n >> 1; m++; } return m; }

Given the position of previous leftmost set bit in n (or an upper bound on leftmost position) returns the new position of leftmost set bit in n

unsigned int getNextLeftmostBit (int n, int m) { unsigned int temp = 1 << m; while (n < temp) { temp = temp >> 1; m--; } return m; }

Main recursive function is countSetBits - Returns count of set bits present in all numbers from 1 to n

unsigned int countSetBits(unsigned int n) { // Get the position of leftmost set bit in n. This will be // used as an upper bound for next set bit function int m = getLeftmostBit (n); // Use the position return _countSetBits (n, m); } unsigned int _countSetBits(unsigned int n, int m) { // Base Case: if n is 0, then set bit count is 0 if (n == 0) return 0; /* get position of next leftmost set bit */ m = getNextLeftmostBit(n, m); // If n is of the form 2^x-1, i.e., if n is like 1, 3, 7, 15, 31,.. etc, // then we are done. // Since positions are considered starting from 0, 1 is added to m if (n == ((unsigned int)1<<(m+1))-1) return (unsigned int)(m+1)*(1<<m); // update n for next recursive call n = n - (1<<m); return (n+1) + countSetBits(n) + m*(1<<(m-1)); }

**Time Complexity:**O(Logn).

From the first look at the implementation, time complexity looks more. But if we take a closer look, statements inside while loop of getNextLeftmostBit() are executed for all 0 bits in n. And the number of times recursion is executed is less than or equal to set bits in n. In other words, if the control goes inside while loop of getNextLeftmostBit(), then it skips those many bits in recursion.

**References**

geeksforgeeks

## 0 comments:

## Post a Comment