Main:bigenough3 from C

Percentage Accurate: 53.5% → 99.8%

Time: 10.5s

Alternatives: 10

Speedup: 0.8×

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.5% 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.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{x + 1}\\ \mathbf{if}\;t\_0 - \sqrt{x} \leq 0:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{1}{x}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x + \left(1 - x\right)}{t\_0 + \sqrt{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (sqrt (+ x 1.0))))
   (if (<= (- t_0 (sqrt x)) 0.0)
     (* 0.5 (sqrt (/ 1.0 x)))
     (/ (+ x (- 1.0 x)) (+ t_0 (sqrt x))))))

C

double code(double x) {
	double t_0 = sqrt((x + 1.0));
	double tmp;
	if ((t_0 - sqrt(x)) <= 0.0) {
		tmp = 0.5 * sqrt((1.0 / x));
	} else {
		tmp = (x + (1.0 - x)) / (t_0 + sqrt(x));
	}
	return tmp;
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) < 0.0

   1. Initial program 3.8%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \sqrt{\frac{1}{x}}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-/.f64 99.8

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

   5. Applied rewrites 99.8%

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

   if 0.0 < (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x))

   1. Initial program 96.5%

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

      1. lift--.f64 N/A

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

      2. flip-- N/A

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

      3. lower-/.f64 N/A

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

      4. lift-sqrt.f64 N/A

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

      5. lift-sqrt.f64 N/A

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

      6. rem-square-sqrt N/A

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

      7. lift-sqrt.f64 N/A

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

      8. lift-sqrt.f64 N/A

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

      9. rem-square-sqrt N/A

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

      10. lift-+.f64 N/A

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

      11. associate--l+ N/A

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

      12. metadata-eval N/A

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

      13. *-rgt-identity N/A

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

      14. lower-+.f64 N/A

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

      15. metadata-eval N/A

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

      16. *-rgt-identity N/A

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

      17. lower--.f64 N/A

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

      18. lower-+.f64 99.9

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

   4. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\frac{x + \left(1 - x\right)}{\sqrt{x + 1} + \sqrt{x}}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 99.3% accurate, 0.5× speedup

Math

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

FPCore

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

C

double code(double x) {
	double t_0 = sqrt((x + 1.0)) - sqrt(x);
	double tmp;
	if (t_0 <= 5e-6) {
		tmp = 0.5 * sqrt((1.0 / 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((x + 1.0d0)) - sqrt(x)
    if (t_0 <= 5d-6) then
        tmp = 0.5d0 * sqrt((1.0d0 / x))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) < 5.00000000000000041e-6

   1. Initial program 4.5%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \sqrt{\frac{1}{x}}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-/.f64 99.5

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

   5. Applied rewrites 99.5%

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

   if 5.00000000000000041e-6 < (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x))

   1. Initial program 99.2%

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

Developer Target 1: 99.8% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024223 
(FPCore (x)
  :name "Main:bigenough3 from C"
  :precision binary64

  :alt
  (! :herbie-platform default (/ 1 (+ (sqrt (+ x 1)) (sqrt x))))

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