#hammingweight

Fixed How to count the number of set bits in a 32-bit integer? #dev #it #asnwer

How to count the number of set bits in a 32-bit integer?

8 bits representing the number 7 look like this:

00000111

Three bits are set.

What are algorithms to determine the number of set bits in a 32-bit integer?

Answer: How to count the number of set bits in a 32-bit integer?

This is known as the ‘Hamming Weight‘, ‘popcount’ or ‘sideways addition’.

The ‘best’ algorithm really depends on which…

How to: How to count the number of set bits in a 32-bit integer?

How to count the number of set bits in a 32-bit integer?

8 bits representing the number 7 look like this:

00000111

Three bits are set.

What are algorithms to determine the number of set bits in a 32-bit integer?

Answer: How to count the number of set bits in a 32-bit integer?

This can be done in O(k), where k is the number of bits set.

int NumberOfSetBits(int n) { int count = 0; while (n) { ++…