⭐Square Root of Integer

int Solution::sqrt(int A) {
    if(A == 0) return 0;

    int low = 1, high = A, res;

    while(low <= high) {
        int mid = low + ((high - low) >> 1);
        if(mid <= A / mid) {
            low = mid + 1;
            res = mid;
        } else 
            high = mid - 1;
    }
    return res;
}

sqrt : function(A){
    if(A == 0)  return A;
    let low = 1, high = A;
    
    while(low <= high) {
        mid = low + ((high - low) >> 1);
        
        if(mid * mid < A) {
            low = mid + 1;
            res = mid;
        } else if (mid * mid > A)
            high = mid - 1;
        else
            return mid;
    }
    
    return res;
}```

Time Complexity: $O(\log n)$

Space Complexity: $O(1)$

Edge case: $A = 0$

PreviousMedian of Array NextRotated Sorted Array Search

Last updated 3 years ago