title: Count Set Bits In An Integer 1
signature: countSetBitsInAnInteger1 :: Integer -> Integer
  countSetBitsInAnInteger1 n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (43) (4) )
  
      printf "TEST-1...%s\n" (driver (94) (5) )
  
      printf "TEST-2...%s\n" (driver (72) (2) )
  
      printf "TEST-3...%s\n" (driver (86) (4) )
  
      printf "TEST-4...%s\n" (driver (42) (3) )
  
      printf "TEST-5...%s\n" (driver (33) (2) )
  
      printf "TEST-6...%s\n" (driver (8) (1) )
  
      printf "TEST-7...%s\n" (driver (74) (3) )
  
      printf "TEST-8...%s\n" (driver (29) (4) )
  
      printf "TEST-9...%s\n" (driver (34) (2) )
  
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 );
  }