Recursion Write a recursive method that returns the number o

Recursion

Write a recursive method that returns the number of 1s in the binary representation of n (an integer parameter to your method). Use the fact that the number of ones in n equals the number of is in the binary representation of n/2, plus 1, if n is odd. The answer for 25 would be 3, since the binary representation is 11001. Handle negative numbers appropriately.

Solution

func ones(n)
{
   if(n<=1)
   {
       return n;
   }
   return ones(n/2)+(n%2);
}