title: Square Root Of An Integer 1
signature: square_root_of_an_integer_1 <- function(x) {
test_code: 
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  validate_solution <- function(actual, expected) {
      toString(actual)==toString(expected)
  }
  
  driver <- function(x, expected){
      if (validate_solution(PLACEHOLDER_FN_NAME(x), expected)){
          "PASSED"
      } else{
          "FAILED"
      }
  }
  
  main <- function() {
      cat(sprintf("TEST-0...%s\n",driver(
          40L, 
          6L
      )))
  
      cat(sprintf("TEST-1...%s\n",driver(
          10L, 
          3L
      )))
  
      cat(sprintf("TEST-2...%s\n",driver(
          46L, 
          6L
      )))
  
      cat(sprintf("TEST-3...%s\n",driver(
          54L, 
          7L
      )))
  
      cat(sprintf("TEST-4...%s\n",driver(
          1L, 
          1L
      )))
  
      cat(sprintf("TEST-5...%s\n",driver(
          67L, 
          8L
      )))
  
      cat(sprintf("TEST-6...%s\n",driver(
          64L, 
          8L
      )))
  
      cat(sprintf("TEST-7...%s\n",driver(
          10L, 
          3L
      )))
  
      cat(sprintf("TEST-8...%s\n",driver(
          75L, 
          8L
      )))
  
      cat(sprintf("TEST-9...%s\n",driver(
          11L, 
          3L
      )))
  
  }
  
  main()
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;
  }