title: Count Set Bits In An Integer 3
signature: func countSetBitsInAnInteger3(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(6, 2)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(58, 4)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(90, 4)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(69, 3)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(15, 4)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(54, 4)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(60, 4)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(51, 4)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(46, 4)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(91, 5)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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 ) );
  }