[LeetCode/easy/BinarySearch] Sort(x)

 

https://leetcode.com/problems/sqrtx/

Sqrt(x) - LeetCode

 

pow함수를 사용하지 않고 sqrt 기능 구현하기

int mySqrt(int x) {
    long n = 1;
    while(n*n <= x){
        n++;
    }
    return n-1;
}