title: Square Root Of An Integer 1
signature: function square_root_of_an_integer_1(x)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(x, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(x), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(40, 6);
      @printf("TEST-0...%s\n",result);
      
      result = driver(10, 3);
      @printf("TEST-1...%s\n",result);
      
      result = driver(46, 6);
      @printf("TEST-2...%s\n",result);
      
      result = driver(54, 7);
      @printf("TEST-3...%s\n",result);
      
      result = driver(1, 1);
      @printf("TEST-4...%s\n",result);
      
      result = driver(67, 8);
      @printf("TEST-5...%s\n",result);
      
      result = driver(64, 8);
      @printf("TEST-6...%s\n",result);
      
      result = driver(10, 3);
      @printf("TEST-7...%s\n",result);
      
      result = driver(75, 8);
      @printf("TEST-8...%s\n",result);
      
      result = driver(11, 3);
      @printf("TEST-9...%s\n",result);
      
  end
  
  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;
  }