title: Square Root Of An Integer 1
signature: func squareRootOfAnInteger1(x 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(x int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(x),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(40, 6)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(10, 3)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(46, 6)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(54, 7)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(1, 1)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(67, 8)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(64, 8)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(10, 3)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(75, 8)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(11, 3)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }