Question

Write a recursive method in **pseudocode** that returns the number of 1’s in the binary representation of N. Use the fact that this equal to the number of 1’s in the representation of N/2, plus 1, if N is odd

java pseudocode is best

Answer 1

JAVA CODE

import java.util.*;
public class Main
{
public static int rec(int n)
{
if(n==0)
return 0;
else if(n==1)
return 1;
else if(n%2==1)
return rec(n/2)+1;
else
return rec(n/2);
}
   public static void main(String[] args) {
   Scanner sc=new Scanner(System.in);
   int n=sc.nextInt();
   System.out.println(rec(n));
      
   }
}

EXPLANATION

• If n==0,return 0
• If n==1,return 1
• If n is odd,return recursive call to method with n/2 plus 1
• If n is even,return recursive call to method with n/2

Hope this helps

please comment if you need further clarification