2sqrt (example 3.1)

Percentage Accurate: 53.9% → 99.7%

Time: 7.1s

Alternatives: 6

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \sqrt{x + 1} - \sqrt{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (sqrt (+ x 1.0)) (sqrt x)))

C

double code(double x) {
	return sqrt((x + 1.0)) - sqrt(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = sqrt((x + 1.0d0)) - sqrt(x)
end function

Java

public static double code(double x) {
	return Math.sqrt((x + 1.0)) - Math.sqrt(x);
}

Python

def code(x):
	return math.sqrt((x + 1.0)) - math.sqrt(x)

Julia

function code(x)
	return Float64(sqrt(Float64(x + 1.0)) - sqrt(x))
end

MATLAB

function tmp = code(x)
	tmp = sqrt((x + 1.0)) - sqrt(x);
end

Wolfram

code[x_] := N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]

Initial Program: 53.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sqrt{x + 1} - \sqrt{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (sqrt (+ x 1.0)) (sqrt x)))

C

double code(double x) {
	return sqrt((x + 1.0)) - sqrt(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = sqrt((x + 1.0d0)) - sqrt(x)
end function

Java

public static double code(double x) {
	return Math.sqrt((x + 1.0)) - Math.sqrt(x);
}

Python

def code(x):
	return math.sqrt((x + 1.0)) - math.sqrt(x)

Julia

function code(x)
	return Float64(sqrt(Float64(x + 1.0)) - sqrt(x))
end

MATLAB

function tmp = code(x)
	tmp = sqrt((x + 1.0)) - sqrt(x);
end

Wolfram

code[x_] := N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\sqrt{x} + \sqrt{1 + x}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ 1.0 (+ (sqrt x) (sqrt (+ 1.0 x)))))

C

double code(double x) {
	return 1.0 / (sqrt(x) + sqrt((1.0 + x)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 1.0d0 / (sqrt(x) + sqrt((1.0d0 + x)))
end function

Java

public static double code(double x) {
	return 1.0 / (Math.sqrt(x) + Math.sqrt((1.0 + x)));
}

Python

def code(x):
	return 1.0 / (math.sqrt(x) + math.sqrt((1.0 + x)))

Julia

function code(x)
	return Float64(1.0 / Float64(sqrt(x) + sqrt(Float64(1.0 + x))))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 / (sqrt(x) + sqrt((1.0 + x)));
end

Wolfram

code[x_] := N[(1.0 / N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 51.9%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Step-by-step derivation

   1. flip-- 51.9%

      \[\leadsto \color{blue}{\frac{\sqrt{x + 1} \cdot \sqrt{x + 1} - \sqrt{x} \cdot \sqrt{x}}{\sqrt{x + 1} + \sqrt{x}}} \]

   2. div-inv 51.9%

      \[\leadsto \color{blue}{\left(\sqrt{x + 1} \cdot \sqrt{x + 1} - \sqrt{x} \cdot \sqrt{x}\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}}} \]

   3. add-sqr-sqrt 51.9%

      \[\leadsto \left(\color{blue}{\left(x + 1\right)} - \sqrt{x} \cdot \sqrt{x}\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

   4. add-sqr-sqrt 52.7%

      \[\leadsto \left(\left(x + 1\right) - \color{blue}{x}\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

   5. associate--l+ 52.7%

      \[\leadsto \color{blue}{\left(x + \left(1 - x\right)\right)} \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

3. Applied egg-rr 52.7%

   \[\leadsto \color{blue}{\left(x + \left(1 - x\right)\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}}} \]
4. Step-by-step derivation

   1. +-commutative 52.7%

      \[\leadsto \color{blue}{\left(\left(1 - x\right) + x\right)} \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

   2. associate-+l- 99.7%

      \[\leadsto \color{blue}{\left(1 - \left(x - x\right)\right)} \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

   3. +-inverses 99.7%

      \[\leadsto \left(1 - \color{blue}{0}\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

   4. metadata-eval 99.7%

      \[\leadsto \color{blue}{1} \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

   5. associate-*r/ 99.7%

      \[\leadsto \color{blue}{\frac{1 \cdot 1}{\sqrt{x + 1} + \sqrt{x}}} \]

   6. metadata-eval 99.7%

      \[\leadsto \frac{\color{blue}{1}}{\sqrt{x + 1} + \sqrt{x}} \]

   7. +-commutative 99.7%

      \[\leadsto \frac{1}{\sqrt{\color{blue}{1 + x}} + \sqrt{x}} \]

5. Simplified 99.7%

   \[\leadsto \color{blue}{\frac{1}{\sqrt{1 + x} + \sqrt{x}}} \]

6. Final simplification 99.7%

   \[\leadsto \frac{1}{\sqrt{x} + \sqrt{1 + x}} \]

Alternative 2: 99.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{1 + x} - \sqrt{x}\\ \mathbf{if}\;t_0 \leq 2 \cdot 10^{-5}:\\ \;\;\;\;\frac{1}{\sqrt{x} + \sqrt{x}}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (- (sqrt (+ 1.0 x)) (sqrt x))))
   (if (<= t_0 2e-5) (/ 1.0 (+ (sqrt x) (sqrt x))) t_0)))

C

double code(double x) {
	double t_0 = sqrt((1.0 + x)) - sqrt(x);
	double tmp;
	if (t_0 <= 2e-5) {
		tmp = 1.0 / (sqrt(x) + sqrt(x));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt((1.0d0 + x)) - sqrt(x)
    if (t_0 <= 2d-5) then
        tmp = 1.0d0 / (sqrt(x) + sqrt(x))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double t_0 = Math.sqrt((1.0 + x)) - Math.sqrt(x);
	double tmp;
	if (t_0 <= 2e-5) {
		tmp = 1.0 / (Math.sqrt(x) + Math.sqrt(x));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x):
	t_0 = math.sqrt((1.0 + x)) - math.sqrt(x)
	tmp = 0
	if t_0 <= 2e-5:
		tmp = 1.0 / (math.sqrt(x) + math.sqrt(x))
	else:
		tmp = t_0
	return tmp

Julia

function code(x)
	t_0 = Float64(sqrt(Float64(1.0 + x)) - sqrt(x))
	tmp = 0.0
	if (t_0 <= 2e-5)
		tmp = Float64(1.0 / Float64(sqrt(x) + sqrt(x)));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	t_0 = sqrt((1.0 + x)) - sqrt(x);
	tmp = 0.0;
	if (t_0 <= 2e-5)
		tmp = 1.0 / (sqrt(x) + sqrt(x));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := Block[{t$95$0 = N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 2e-5], N[(1.0 / N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (sqrt.f64 (+.f64 x 1)) (sqrt.f64 x)) < 2.00000000000000016e-5

   1. Initial program 5.5%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Step-by-step derivation

      1. flip-- 5.4%

         \[\leadsto \color{blue}{\frac{\sqrt{x + 1} \cdot \sqrt{x + 1} - \sqrt{x} \cdot \sqrt{x}}{\sqrt{x + 1} + \sqrt{x}}} \]

      2. div-inv 5.4%

         \[\leadsto \color{blue}{\left(\sqrt{x + 1} \cdot \sqrt{x + 1} - \sqrt{x} \cdot \sqrt{x}\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}}} \]

      3. add-sqr-sqrt 5.5%

         \[\leadsto \left(\color{blue}{\left(x + 1\right)} - \sqrt{x} \cdot \sqrt{x}\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

      4. add-sqr-sqrt 6.9%

         \[\leadsto \left(\left(x + 1\right) - \color{blue}{x}\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

      5. associate--l+ 6.9%

         \[\leadsto \color{blue}{\left(x + \left(1 - x\right)\right)} \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

   3. Applied egg-rr 6.9%

      \[\leadsto \color{blue}{\left(x + \left(1 - x\right)\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}}} \]
   4. Step-by-step derivation

      1. +-commutative 6.9%

         \[\leadsto \color{blue}{\left(\left(1 - x\right) + x\right)} \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

      2. associate-+l- 99.6%

         \[\leadsto \color{blue}{\left(1 - \left(x - x\right)\right)} \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

      3. +-inverses 99.6%

         \[\leadsto \left(1 - \color{blue}{0}\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

      4. metadata-eval 99.6%

         \[\leadsto \color{blue}{1} \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

      5. associate-*r/ 99.6%

         \[\leadsto \color{blue}{\frac{1 \cdot 1}{\sqrt{x + 1} + \sqrt{x}}} \]

      6. metadata-eval 99.6%

         \[\leadsto \frac{\color{blue}{1}}{\sqrt{x + 1} + \sqrt{x}} \]

      7. +-commutative 99.6%

         \[\leadsto \frac{1}{\sqrt{\color{blue}{1 + x}} + \sqrt{x}} \]

   5. Simplified 99.6%

      \[\leadsto \color{blue}{\frac{1}{\sqrt{1 + x} + \sqrt{x}}} \]
   6. Step-by-step derivation

      1. pow1/2 99.6%

         \[\leadsto \frac{1}{\color{blue}{{\left(1 + x\right)}^{0.5}} + \sqrt{x}} \]

      2. pow-to-exp 93.6%

         \[\leadsto \frac{1}{\color{blue}{e^{\log \left(1 + x\right) \cdot 0.5}} + \sqrt{x}} \]

      3. log1p-udef 93.6%

         \[\leadsto \frac{1}{e^{\color{blue}{\mathsf{log1p}\left(x\right)} \cdot 0.5} + \sqrt{x}} \]

   7. Applied egg-rr 93.6%

      \[\leadsto \frac{1}{\color{blue}{e^{\mathsf{log1p}\left(x\right) \cdot 0.5}} + \sqrt{x}} \]

   8. Taylor expanded in x around inf 98.7%

      \[\leadsto \frac{1}{\color{blue}{\sqrt{x}} + \sqrt{x}} \]

   if 2.00000000000000016e-5 < (-.f64 (sqrt.f64 (+.f64 x 1)) (sqrt.f64 x))

   1. Initial program 99.7%

      \[\sqrt{x + 1} - \sqrt{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sqrt{1 + x} - \sqrt{x} \leq 2 \cdot 10^{-5}:\\ \;\;\;\;\frac{1}{\sqrt{x} + \sqrt{x}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{1 + x} - \sqrt{x}\\ \end{array} \]

Alternative 3: 53.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sqrt{1 + x} - \sqrt{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (sqrt (+ 1.0 x)) (sqrt x)))

C

double code(double x) {
	return sqrt((1.0 + x)) - sqrt(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = sqrt((1.0d0 + x)) - sqrt(x)
end function

Java

public static double code(double x) {
	return Math.sqrt((1.0 + x)) - Math.sqrt(x);
}

Python

def code(x):
	return math.sqrt((1.0 + x)) - math.sqrt(x)

Julia

function code(x)
	return Float64(sqrt(Float64(1.0 + x)) - sqrt(x))
end

MATLAB

function tmp = code(x)
	tmp = sqrt((1.0 + x)) - sqrt(x);
end

Wolfram

code[x_] := N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 51.9%

   \[\sqrt{x + 1} - \sqrt{x} \]

2. Final simplification 51.9%

   \[\leadsto \sqrt{1 + x} - \sqrt{x} \]

Alternative 4: 53.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\sqrt{x} + \left(1 + x \cdot 0.5\right)} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ 1.0 (+ (sqrt x) (+ 1.0 (* x 0.5)))))

C

double code(double x) {
	return 1.0 / (sqrt(x) + (1.0 + (x * 0.5)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 1.0d0 / (sqrt(x) + (1.0d0 + (x * 0.5d0)))
end function

Java

public static double code(double x) {
	return 1.0 / (Math.sqrt(x) + (1.0 + (x * 0.5)));
}

Python

def code(x):
	return 1.0 / (math.sqrt(x) + (1.0 + (x * 0.5)))

Julia

function code(x)
	return Float64(1.0 / Float64(sqrt(x) + Float64(1.0 + Float64(x * 0.5))))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 / (sqrt(x) + (1.0 + (x * 0.5)));
end

Wolfram

code[x_] := N[(1.0 / N[(N[Sqrt[x], $MachinePrecision] + N[(1.0 + N[(x * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 51.9%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Step-by-step derivation

   1. flip-- 51.9%

      \[\leadsto \color{blue}{\frac{\sqrt{x + 1} \cdot \sqrt{x + 1} - \sqrt{x} \cdot \sqrt{x}}{\sqrt{x + 1} + \sqrt{x}}} \]

   2. div-inv 51.9%

      \[\leadsto \color{blue}{\left(\sqrt{x + 1} \cdot \sqrt{x + 1} - \sqrt{x} \cdot \sqrt{x}\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}}} \]

   3. add-sqr-sqrt 51.9%

      \[\leadsto \left(\color{blue}{\left(x + 1\right)} - \sqrt{x} \cdot \sqrt{x}\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

   4. add-sqr-sqrt 52.7%

      \[\leadsto \left(\left(x + 1\right) - \color{blue}{x}\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

   5. associate--l+ 52.7%

      \[\leadsto \color{blue}{\left(x + \left(1 - x\right)\right)} \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

3. Applied egg-rr 52.7%

   \[\leadsto \color{blue}{\left(x + \left(1 - x\right)\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}}} \]
4. Step-by-step derivation

   1. +-commutative 52.7%

      \[\leadsto \color{blue}{\left(\left(1 - x\right) + x\right)} \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

   2. associate-+l- 99.7%

      \[\leadsto \color{blue}{\left(1 - \left(x - x\right)\right)} \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

   3. +-inverses 99.7%

      \[\leadsto \left(1 - \color{blue}{0}\right) \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

   4. metadata-eval 99.7%

      \[\leadsto \color{blue}{1} \cdot \frac{1}{\sqrt{x + 1} + \sqrt{x}} \]

   5. associate-*r/ 99.7%

      \[\leadsto \color{blue}{\frac{1 \cdot 1}{\sqrt{x + 1} + \sqrt{x}}} \]

   6. metadata-eval 99.7%

      \[\leadsto \frac{\color{blue}{1}}{\sqrt{x + 1} + \sqrt{x}} \]

   7. +-commutative 99.7%

      \[\leadsto \frac{1}{\sqrt{\color{blue}{1 + x}} + \sqrt{x}} \]

5. Simplified 99.7%

   \[\leadsto \color{blue}{\frac{1}{\sqrt{1 + x} + \sqrt{x}}} \]

6. Taylor expanded in x around 0 51.3%

   \[\leadsto \frac{1}{\color{blue}{\left(1 + 0.5 \cdot x\right)} + \sqrt{x}} \]

7. Final simplification 51.3%

   \[\leadsto \frac{1}{\sqrt{x} + \left(1 + x \cdot 0.5\right)} \]

Alternative 5: 52.3% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ 1 + \left(x \cdot 0.5 - \sqrt{x}\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (+ 1.0 (- (* x 0.5) (sqrt x))))

C

double code(double x) {
	return 1.0 + ((x * 0.5) - sqrt(x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 1.0d0 + ((x * 0.5d0) - sqrt(x))
end function

Java

public static double code(double x) {
	return 1.0 + ((x * 0.5) - Math.sqrt(x));
}

Python

def code(x):
	return 1.0 + ((x * 0.5) - math.sqrt(x))

Julia

function code(x)
	return Float64(1.0 + Float64(Float64(x * 0.5) - sqrt(x)))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 + ((x * 0.5) - sqrt(x));
end

Wolfram

code[x_] := N[(1.0 + N[(N[(x * 0.5), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 51.9%

   \[\sqrt{x + 1} - \sqrt{x} \]

2. Taylor expanded in x around 0 50.0%

   \[\leadsto \color{blue}{\left(1 + 0.5 \cdot x\right)} - \sqrt{x} \]
3. Step-by-step derivation

   1. associate--l+ 50.0%

      \[\leadsto \color{blue}{1 + \left(0.5 \cdot x - \sqrt{x}\right)} \]

   2. +-commutative 50.0%

      \[\leadsto \color{blue}{\left(0.5 \cdot x - \sqrt{x}\right) + 1} \]

   3. *-commutative 50.0%

      \[\leadsto \left(\color{blue}{x \cdot 0.5} - \sqrt{x}\right) + 1 \]

4. Applied egg-rr 50.0%

   \[\leadsto \color{blue}{\left(x \cdot 0.5 - \sqrt{x}\right) + 1} \]

5. Final simplification 50.0%

   \[\leadsto 1 + \left(x \cdot 0.5 - \sqrt{x}\right) \]

Alternative 6: 51.9% accurate, 205.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (x) :precision binary64 1.0)

C

double code(double x) {
	return 1.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 1.0d0
end function

Java

public static double code(double x) {
	return 1.0;
}

Python

def code(x):
	return 1.0

Julia

function code(x)
	return 1.0
end

MATLAB

function tmp = code(x)
	tmp = 1.0;
end

Wolfram

code[x_] := 1.0

Derivation

1. Initial program 51.9%

   \[\sqrt{x + 1} - \sqrt{x} \]

2. Taylor expanded in x around 0 49.1%

   \[\leadsto \color{blue}{1} \]

3. Final simplification 49.1%

   \[\leadsto 1 \]

Developer target: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 66000000:\\ \;\;\;\;\sqrt{1 + x} - \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sqrt{x + 1} + \sqrt{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 66000000.0)
   (- (sqrt (+ 1.0 x)) (sqrt x))
   (/ 1.0 (+ (sqrt (+ x 1.0)) (sqrt x)))))

C

double code(double x) {
	double tmp;
	if (x <= 66000000.0) {
		tmp = sqrt((1.0 + x)) - sqrt(x);
	} else {
		tmp = 1.0 / (sqrt((x + 1.0)) + sqrt(x));
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 66000000.0d0) then
        tmp = sqrt((1.0d0 + x)) - sqrt(x)
    else
        tmp = 1.0d0 / (sqrt((x + 1.0d0)) + sqrt(x))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 66000000.0) {
		tmp = Math.sqrt((1.0 + x)) - Math.sqrt(x);
	} else {
		tmp = 1.0 / (Math.sqrt((x + 1.0)) + Math.sqrt(x));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 66000000.0:
		tmp = math.sqrt((1.0 + x)) - math.sqrt(x)
	else:
		tmp = 1.0 / (math.sqrt((x + 1.0)) + math.sqrt(x))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 66000000.0)
		tmp = Float64(sqrt(Float64(1.0 + x)) - sqrt(x));
	else
		tmp = Float64(1.0 / Float64(sqrt(Float64(x + 1.0)) + sqrt(x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 66000000.0)
		tmp = sqrt((1.0 + x)) - sqrt(x);
	else
		tmp = 1.0 / (sqrt((x + 1.0)) + sqrt(x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 66000000.0], N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Reproduce

herbie shell --seed 2023333 
(FPCore (x)
  :name "2sqrt (example 3.1)"
  :precision binary64

  :herbie-target
  (if (<= x 66000000.0) (- (sqrt (+ 1.0 x)) (sqrt x)) (/ 1.0 (+ (sqrt (+ x 1.0)) (sqrt x))))

  (- (sqrt (+ x 1.0)) (sqrt x)))