title: Square Root Of An Integer
signature: function square_root_of_an_integer(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(89, 9);
      @printf("TEST-0...%s\n",result);
      
      result = driver(11, 3);
      @printf("TEST-1...%s\n",result);
      
      result = driver(14, 3);
      @printf("TEST-2...%s\n",result);
      
      result = driver(92, 9);
      @printf("TEST-3...%s\n",result);
      
      result = driver(76, 8);
      @printf("TEST-4...%s\n",result);
      
      result = driver(63, 7);
      @printf("TEST-5...%s\n",result);
      
      result = driver(51, 7);
      @printf("TEST-6...%s\n",result);
      
      result = driver(16, 4);
      @printf("TEST-7...%s\n",result);
      
      result = driver(83, 9);
      @printf("TEST-8...%s\n",result);
      
      result = driver(66, 8);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def square_root_of_an_integer(x):
      if ((x == 0) or (x == 1)):
          return x
      i = 1
      result = 1
      while (result <= x):
          i += 1
          result = (i * i)
      return (i - 1)
source_cpp: int square_root_of_an_integer(int x) {
    if ( x == 0 || x == 1 ) return x;
    int i = 1, result = 1;
    while ( result <= x ) {
      i ++;
      result = i * i;
    }
    return i - 1;
  }