Squareroot_binary_search.cpp

#include<iostream>
using namespace std;
long long int binarysearch(int n)
    {
        int s=0;
        int e=n;
        long long int mid=s+(e-s)/2;
        long long int ans=-1;
        while(s<=e)
        {
            long long int sq=mid*mid;
            if(sq==n)
                return mid;
            else if(sq>n)
            {
                e=mid-1;
            }
            else
            {
                ans=mid;
                s=mid+1;
            }
            mid=s+(e-s)/2;
        }
        return ans;
        
    }
    double morePrecision(int n, int precision, int tempSol) {
    
    double factor = 1;
    double ans = tempSol;

    for(int i=0; i<precision; i++) {
        factor = factor/10;

        for(double j=ans; j*j<n; j= j+factor ){
            ans = j;
        }
    }
    return ans;
}
    int main()
    {
       int n;
    cout <<" Enter the number " << endl;
    cin >> n;

    int tempSol = binarysearch(n);
    cout <<" Answer is " << morePrecision(n, 3, tempSol) << endl;

    return 0;
    }