Ones.java

// Recursion - James Riback
package recursionones;

public class RecursionOnes {
    
   static int getOnes(int num, int count) // number of times the value 1 appears in a number converted to binary
   {
       if(num >0)
       {
          count = num % 2 == 1 ? count + 1 : count; // if the remainder is equal to 1, we count it
          return getOnes(num/2, count);
       }
       return count;
   }
   
  
    
    public static void main(String[] args) {
       System.out.println("Number of ones: " + getOnes(11, 0));
    }
    
}