title: Count Set Bits In An Integer 1
signature: function count_set_bits_in_an_integer_1(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(43, 4);
      @printf("TEST-0...%s\n",result);
      
      result = driver(94, 5);
      @printf("TEST-1...%s\n",result);
      
      result = driver(72, 2);
      @printf("TEST-2...%s\n",result);
      
      result = driver(86, 4);
      @printf("TEST-3...%s\n",result);
      
      result = driver(42, 3);
      @printf("TEST-4...%s\n",result);
      
      result = driver(33, 2);
      @printf("TEST-5...%s\n",result);
      
      result = driver(8, 1);
      @printf("TEST-6...%s\n",result);
      
      result = driver(74, 3);
      @printf("TEST-7...%s\n",result);
      
      result = driver(29, 4);
      @printf("TEST-8...%s\n",result);
      
      result = driver(34, 2);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def count_set_bits_in_an_integer_1(n):
      if (n == 0):
          return 0
      else:
          return ((n & 1) + count_set_bits_in_an_integer_1((n >> 1)))
source_cpp: int count_set_bits_in_an_integer_1(int n) {
    if ( n == 0 ) return 0;
    else return ( n & 1 ) + count_set_bits_in_an_integer_1 ( n >> 1 );
  }