Ask Question
10 March, 02:27

5 write a recursive method that returns the number of 1's in the binary representation of n. use the fact that this is equal to the number of 1's in the representation of n/2, plus 1, if n is odd.

+1
Answers (1)
  1. 10 March, 05:24
    0
    Assuming n is a decimal number.

    Divide n by 2 repeatedly, and summing the remainders will give the number of one's in binary representation.

    pseudocode of algorithm:

    Enter value of n:

    sum=0;

    while n>0 {

    sum=mod (n, 2);

    n=n/2 [integer division]

    }

    Display n, sum
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “5 write a recursive method that returns the number of 1's in the binary representation of n. use the fact that this is equal to the number ...” in 📙 Mathematics if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers