The Hamming Weight

Counting the Charge

In bitwise computation, the Hamming weight is the count of symbols that are different from zero. For integers, this is the count of 1s in their binary form.

The Assignment

Your function receives a parameter num.

1. Initialize count to 0.
2. Use a while loop as long as num is greater than 0.
3. In each step:
   • Check if the number is odd (num % 2 !== 0). If yes, increment count.
   • Update num by dividing by 2 and rounding down.
4. Print the final count.