title: Count Set Bits In An Integer 3
signature: function count_set_bits_in_an_integer_3(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(6, 2);
      @printf("TEST-0...%s\n",result);
      
      result = driver(58, 4);
      @printf("TEST-1...%s\n",result);
      
      result = driver(90, 4);
      @printf("TEST-2...%s\n",result);
      
      result = driver(69, 3);
      @printf("TEST-3...%s\n",result);
      
      result = driver(15, 4);
      @printf("TEST-4...%s\n",result);
      
      result = driver(54, 4);
      @printf("TEST-5...%s\n",result);
      
      result = driver(60, 4);
      @printf("TEST-6...%s\n",result);
      
      result = driver(51, 4);
      @printf("TEST-7...%s\n",result);
      
      result = driver(46, 4);
      @printf("TEST-8...%s\n",result);
      
      result = driver(91, 5);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def count_set_bits_in_an_integer_3(n):
      if (n == 0):
          return 0
      else:
          return (1 + count_set_bits_in_an_integer_3((n & (n - 1))))
source_cpp: int count_set_bits_in_an_integer_3(int n) {
    if ( n == 0 ) return 0;
    else return 1 + count_set_bits_in_an_integer_3 ( n & ( n - 1 ) );
  }