Square Root without Built-In function. Time Complexity?

What is the time complexity of the following programming?

class SquareRoot
{
    public static void main(String[] args)
    {
        double number = 25;
        System.out.println(getSquareRoot(number));
    }
    
    public static double getSquareRoot(double number)
    {
        double temp;
        double squareRoot = number / 2;
        do
        {
            temp = squareRoot;
            squareRoot = (temp + (number / temp)) / 2;
        } while ((temp - squareRoot) != 0);
        return squareRoot;
    }
}