title: Square Root Of An Integer 1
signature: squareRootOfAnInteger1 :: Integer -> Integer
  squareRootOfAnInteger1 x = 
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 x expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME x) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (40) (6) )
  
      printf "TEST-1...%s\n" (driver (10) (3) )
  
      printf "TEST-2...%s\n" (driver (46) (6) )
  
      printf "TEST-3...%s\n" (driver (54) (7) )
  
      printf "TEST-4...%s\n" (driver (1) (1) )
  
      printf "TEST-5...%s\n" (driver (67) (8) )
  
      printf "TEST-6...%s\n" (driver (64) (8) )
  
      printf "TEST-7...%s\n" (driver (10) (3) )
  
      printf "TEST-8...%s\n" (driver (75) (8) )
  
      printf "TEST-9...%s\n" (driver (11) (3) )
  
source_py: def square_root_of_an_integer_1(x):
      if ((x == 0) or (x == 1)):
          return x
      start = 1
      end = x
      while (start <= end):
          mid = ((start + end) // 2)
          if ((mid * mid) == x):
              return mid
          if ((mid * mid) < x):
              start = (mid + 1)
              ans = mid
          else:
              end = (mid - 1)
      return ans
source_cpp: int square_root_of_an_integer_1(int x) {
    if ( x == 0 || x == 1 ) return x;
    int start = 1, end = x, ans;
    while ( start <= end ) {
      int mid = ( start + end ) / 2;
      if ( mid * mid == x ) return mid;
      if ( mid * mid < x ) {
        start = mid + 1;
        ans = mid;
      }
      else end = mid - 1;
    }
    return ans;
  }