Main:bigenough3 from C

Percentage Accurate: 53.8% → 99.7%

Time: 8.6s

Alternatives: 10

Speedup: 2.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.8% 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, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 2: 99.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{x + 1} - \sqrt{x}\\ \mathbf{if}\;t_0 \leq 0.0001:\\ \;\;\;\;0.5 \cdot {x}^{-0.5}\\ \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 0.0001) (* 0.5 (pow x -0.5)) t_0)))

C

double code(double x) {
	double t_0 = sqrt((x + 1.0)) - sqrt(x);
	double tmp;
	if (t_0 <= 0.0001) {
		tmp = 0.5 * pow(x, -0.5);
	} 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 <= 0.0001d0) then
        tmp = 0.5d0 * (x ** (-0.5d0))
    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 <= 0.0001) {
		tmp = 0.5 * Math.pow(x, -0.5);
	} 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 <= 0.0001:
		tmp = 0.5 * math.pow(x, -0.5)
	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 <= 0.0001)
		tmp = Float64(0.5 * (x ^ -0.5));
	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 <= 0.0001)
		tmp = 0.5 * (x ^ -0.5);
	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, 0.0001], N[(0.5 * N[Power[x, -0.5], $MachinePrecision]), $MachinePrecision], t$95$0]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 3: 99.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\sqrt{x} + \mathsf{hypot}\left(1, \sqrt{x}\right)} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 4: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 5: 98.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1.22:\\ \;\;\;\;\left(1 + x \cdot \left(0.5 + x \cdot -0.125\right)\right) - \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot {x}^{-0.5}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 1.22)
   (- (+ 1.0 (* x (+ 0.5 (* x -0.125)))) (sqrt x))
   (* 0.5 (pow x -0.5))))

C

double code(double x) {
	double tmp;
	if (x <= 1.22) {
		tmp = (1.0 + (x * (0.5 + (x * -0.125)))) - sqrt(x);
	} else {
		tmp = 0.5 * pow(x, -0.5);
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x) {
	double tmp;
	if (x <= 1.22) {
		tmp = (1.0 + (x * (0.5 + (x * -0.125)))) - Math.sqrt(x);
	} else {
		tmp = 0.5 * Math.pow(x, -0.5);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 1.22:
		tmp = (1.0 + (x * (0.5 + (x * -0.125)))) - math.sqrt(x)
	else:
		tmp = 0.5 * math.pow(x, -0.5)
	return tmp

Julia

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

MATLAB

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

Wolfram

code[x_] := If[LessEqual[x, 1.22], N[(N[(1.0 + N[(x * N[(0.5 + N[(x * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Power[x, -0.5], $MachinePrecision]), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 6: 98.4% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1:\\ \;\;\;\;1 + \left(x \cdot 0.5 - \sqrt{x}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot {x}^{-0.5}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 1.0) (+ 1.0 (- (* x 0.5) (sqrt x))) (* 0.5 (pow x -0.5))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 7: 97.8% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 8: 96.7% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0.25:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot {x}^{-0.5}\\ \end{array} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (if (<= x 0.25) 1.0 (* 0.5 (pow x -0.5))))

C

double code(double x) {
	double tmp;
	if (x <= 0.25) {
		tmp = 1.0;
	} else {
		tmp = 0.5 * pow(x, -0.5);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 0.25d0) then
        tmp = 1.0d0
    else
        tmp = 0.5d0 * (x ** (-0.5d0))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 0.25) {
		tmp = 1.0;
	} else {
		tmp = 0.5 * Math.pow(x, -0.5);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 0.25:
		tmp = 1.0
	else:
		tmp = 0.5 * math.pow(x, -0.5)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 0.25)
		tmp = 1.0;
	else
		tmp = Float64(0.5 * (x ^ -0.5));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 0.25)
		tmp = 1.0;
	else
		tmp = 0.5 * (x ^ -0.5);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 0.25], 1.0, N[(0.5 * N[Power[x, -0.5], $MachinePrecision]), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 9: 57.4% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 10: 51.6% 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

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Developer target: 99.7% accurate, 1.0× 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 2024008 
(FPCore (x)
  :name "Main:bigenough3 from C"
  :precision binary64

  :herbie-target
  (/ 1.0 (+ (sqrt (+ x 1.0)) (sqrt x)))

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