jeff quadratic root 2

Percentage Accurate: 72.5% → 90.1%

Time: 18.0s

Alternatives: 6

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - t_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + t_0}{2 \cdot a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b b) (* (* 4.0 a) c)))))
   (if (>= b 0.0) (/ (* 2.0 c) (- (- b) t_0)) (/ (+ (- b) t_0) (* 2.0 a)))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (2.0 * c) / (-b - t_0);
	} else {
		tmp = (-b + t_0) / (2.0 * a);
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt(((b * b) - ((4.0d0 * a) * c)))
    if (b >= 0.0d0) then
        tmp = (2.0d0 * c) / (-b - t_0)
    else
        tmp = (-b + t_0) / (2.0d0 * a)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (2.0 * c) / (-b - t_0);
	} else {
		tmp = (-b + t_0) / (2.0 * a);
	}
	return tmp;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((b * b) - ((4.0 * a) * c)))
	tmp = 0
	if b >= 0.0:
		tmp = (2.0 * c) / (-b - t_0)
	else:
		tmp = (-b + t_0) / (2.0 * a)
	return tmp

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) - t_0));
	else
		tmp = Float64(Float64(Float64(-b) + t_0) / Float64(2.0 * a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	tmp = 0.0;
	if (b >= 0.0)
		tmp = (2.0 * c) / (-b - t_0);
	else
		tmp = (-b + t_0) / (2.0 * a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) - t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[((-b) + t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]]]

Initial Program: 72.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - t_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + t_0}{2 \cdot a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b b) (* (* 4.0 a) c)))))
   (if (>= b 0.0) (/ (* 2.0 c) (- (- b) t_0)) (/ (+ (- b) t_0) (* 2.0 a)))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (2.0 * c) / (-b - t_0);
	} else {
		tmp = (-b + t_0) / (2.0 * a);
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt(((b * b) - ((4.0d0 * a) * c)))
    if (b >= 0.0d0) then
        tmp = (2.0d0 * c) / (-b - t_0)
    else
        tmp = (-b + t_0) / (2.0d0 * a)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (2.0 * c) / (-b - t_0);
	} else {
		tmp = (-b + t_0) / (2.0 * a);
	}
	return tmp;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((b * b) - ((4.0 * a) * c)))
	tmp = 0
	if b >= 0.0:
		tmp = (2.0 * c) / (-b - t_0)
	else:
		tmp = (-b + t_0) / (2.0 * a)
	return tmp

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) - t_0));
	else
		tmp = Float64(Float64(Float64(-b) + t_0) / Float64(2.0 * a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	tmp = 0.0;
	if (b >= 0.0)
		tmp = (2.0 * c) / (-b - t_0);
	else
		tmp = (-b + t_0) / (2.0 * a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) - t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[((-b) + t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]]]

Alternative 1: 90.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)}\\ \mathbf{if}\;b \leq -4 \cdot 10^{+140}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;c \cdot \frac{2}{\left(a \cdot \frac{c}{b}\right) \cdot \left(--2\right)}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{b + \left(b - 2 \cdot \left(c \cdot \frac{a}{b}\right)\right)}{a}\\ \end{array}\\ \mathbf{elif}\;b \leq 6.5 \cdot 10^{+47}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c \cdot 2}{\left(-b\right) - t_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{t_0 - b}{2 \cdot a}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{b + b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b b) (* c (* a 4.0))))))
   (if (<= b -4e+140)
     (if (>= b 0.0)
       (* c (/ 2.0 (* (* a (/ c b)) (- -2.0))))
       (* -0.5 (/ (+ b (- b (* 2.0 (* c (/ a b))))) a)))
     (if (<= b 6.5e+47)
       (if (>= b 0.0) (/ (* c 2.0) (- (- b) t_0)) (/ (- t_0 b) (* 2.0 a)))
       (if (>= b 0.0) (/ (- c) b) (* -0.5 (/ (+ b b) a)))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((b * b) - (c * (a * 4.0))));
	double tmp_1;
	if (b <= -4e+140) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = c * (2.0 / ((a * (c / b)) * -(-2.0)));
		} else {
			tmp_2 = -0.5 * ((b + (b - (2.0 * (c * (a / b))))) / a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 6.5e+47) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (c * 2.0) / (-b - t_0);
		} else {
			tmp_3 = (t_0 - b) / (2.0 * a);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = -c / b;
	} else {
		tmp_1 = -0.5 * ((b + b) / a);
	}
	return tmp_1;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    t_0 = sqrt(((b * b) - (c * (a * 4.0d0))))
    if (b <= (-4d+140)) then
        if (b >= 0.0d0) then
            tmp_2 = c * (2.0d0 / ((a * (c / b)) * -(-2.0d0)))
        else
            tmp_2 = (-0.5d0) * ((b + (b - (2.0d0 * (c * (a / b))))) / a)
        end if
        tmp_1 = tmp_2
    else if (b <= 6.5d+47) then
        if (b >= 0.0d0) then
            tmp_3 = (c * 2.0d0) / (-b - t_0)
        else
            tmp_3 = (t_0 - b) / (2.0d0 * a)
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = -c / b
    else
        tmp_1 = (-0.5d0) * ((b + b) / a)
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((b * b) - (c * (a * 4.0))));
	double tmp_1;
	if (b <= -4e+140) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = c * (2.0 / ((a * (c / b)) * -(-2.0)));
		} else {
			tmp_2 = -0.5 * ((b + (b - (2.0 * (c * (a / b))))) / a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 6.5e+47) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (c * 2.0) / (-b - t_0);
		} else {
			tmp_3 = (t_0 - b) / (2.0 * a);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = -c / b;
	} else {
		tmp_1 = -0.5 * ((b + b) / a);
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((b * b) - (c * (a * 4.0))))
	tmp_1 = 0
	if b <= -4e+140:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = c * (2.0 / ((a * (c / b)) * -(-2.0)))
		else:
			tmp_2 = -0.5 * ((b + (b - (2.0 * (c * (a / b))))) / a)
		tmp_1 = tmp_2
	elif b <= 6.5e+47:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = (c * 2.0) / (-b - t_0)
		else:
			tmp_3 = (t_0 - b) / (2.0 * a)
		tmp_1 = tmp_3
	elif b >= 0.0:
		tmp_1 = -c / b
	else:
		tmp_1 = -0.5 * ((b + b) / a)
	return tmp_1

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0))))
	tmp_1 = 0.0
	if (b <= -4e+140)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(c * Float64(2.0 / Float64(Float64(a * Float64(c / b)) * Float64(-(-2.0)))));
		else
			tmp_2 = Float64(-0.5 * Float64(Float64(b + Float64(b - Float64(2.0 * Float64(c * Float64(a / b))))) / a));
		end
		tmp_1 = tmp_2;
	elseif (b <= 6.5e+47)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(c * 2.0) / Float64(Float64(-b) - t_0));
		else
			tmp_3 = Float64(Float64(t_0 - b) / Float64(2.0 * a));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-c) / b);
	else
		tmp_1 = Float64(-0.5 * Float64(Float64(b + b) / a));
	end
	return tmp_1
end

MATLAB

function tmp_5 = code(a, b, c)
	t_0 = sqrt(((b * b) - (c * (a * 4.0))));
	tmp_2 = 0.0;
	if (b <= -4e+140)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = c * (2.0 / ((a * (c / b)) * -(-2.0)));
		else
			tmp_3 = -0.5 * ((b + (b - (2.0 * (c * (a / b))))) / a);
		end
		tmp_2 = tmp_3;
	elseif (b <= 6.5e+47)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = (c * 2.0) / (-b - t_0);
		else
			tmp_4 = (t_0 - b) / (2.0 * a);
		end
		tmp_2 = tmp_4;
	elseif (b >= 0.0)
		tmp_2 = -c / b;
	else
		tmp_2 = -0.5 * ((b + b) / a);
	end
	tmp_5 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(c * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -4e+140], If[GreaterEqual[b, 0.0], N[(c * N[(2.0 / N[(N[(a * N[(c / b), $MachinePrecision]), $MachinePrecision] * (--2.0)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(N[(b + N[(b - N[(2.0 * N[(c * N[(a / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 6.5e+47], If[GreaterEqual[b, 0.0], N[(N[(c * 2.0), $MachinePrecision] / N[((-b) - t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 - b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[((-c) / b), $MachinePrecision], N[(-0.5 * N[(N[(b + b), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

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

Alternative 2: 67.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := c \cdot \frac{a}{b}\\ \mathbf{if}\;b \geq 0:\\ \;\;\;\;c \cdot \frac{-2}{b + \mathsf{fma}\left(-2, t_0, b\right)}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{b + \left(b - 2 \cdot t_0\right)}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (* c (/ a b))))
   (if (>= b 0.0)
     (* c (/ -2.0 (+ b (fma -2.0 t_0 b))))
     (* -0.5 (/ (+ b (- b (* 2.0 t_0))) a)))))

C

double code(double a, double b, double c) {
	double t_0 = c * (a / b);
	double tmp;
	if (b >= 0.0) {
		tmp = c * (-2.0 / (b + fma(-2.0, t_0, b)));
	} else {
		tmp = -0.5 * ((b + (b - (2.0 * t_0))) / a);
	}
	return tmp;
}

Julia

function code(a, b, c)
	t_0 = Float64(c * Float64(a / b))
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(c * Float64(-2.0 / Float64(b + fma(-2.0, t_0, b))));
	else
		tmp = Float64(-0.5 * Float64(Float64(b + Float64(b - Float64(2.0 * t_0))) / a));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[(c * N[(a / b), $MachinePrecision]), $MachinePrecision]}, If[GreaterEqual[b, 0.0], N[(c * N[(-2.0 / N[(b + N[(-2.0 * t$95$0 + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(N[(b + N[(b - N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]]

Derivation

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

Alternative 3: 67.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;c \cdot \frac{-2}{b + \mathsf{fma}\left(-2, c \cdot \frac{a}{b}, b\right)}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{\mathsf{fma}\left(-2, \frac{a}{\frac{b}{c}}, b \cdot 2\right)}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (>= b 0.0)
   (* c (/ -2.0 (+ b (fma -2.0 (* c (/ a b)) b))))
   (* -0.5 (/ (fma -2.0 (/ a (/ b c)) (* b 2.0)) a))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = c * (-2.0 / (b + fma(-2.0, (c * (a / b)), b)));
	} else {
		tmp = -0.5 * (fma(-2.0, (a / (b / c)), (b * 2.0)) / a);
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(c * Float64(-2.0 / Float64(b + fma(-2.0, Float64(c * Float64(a / b)), b))));
	else
		tmp = Float64(-0.5 * Float64(fma(-2.0, Float64(a / Float64(b / c)), Float64(b * 2.0)) / a));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[GreaterEqual[b, 0.0], N[(c * N[(-2.0 / N[(b + N[(-2.0 * N[(c * N[(a / b), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(N[(-2.0 * N[(a / N[(b / c), $MachinePrecision]), $MachinePrecision] + N[(b * 2.0), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 4: 36.3% accurate, 13.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;c \cdot -2\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{b + b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (>= b 0.0) (* c -2.0) (* -0.5 (/ (+ b b) a))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = c * -2.0;
	} else {
		tmp = -0.5 * ((b + b) / a);
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b >= 0.0d0) then
        tmp = c * (-2.0d0)
    else
        tmp = (-0.5d0) * ((b + b) / a)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = c * -2.0;
	} else {
		tmp = -0.5 * ((b + b) / a);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = c * -2.0
	else:
		tmp = -0.5 * ((b + b) / a)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(c * -2.0);
	else
		tmp = Float64(-0.5 * Float64(Float64(b + b) / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b >= 0.0)
		tmp = c * -2.0;
	else
		tmp = -0.5 * ((b + b) / a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[GreaterEqual[b, 0.0], N[(c * -2.0), $MachinePrecision], N[(-0.5 * N[(N[(b + b), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 5: 67.6% accurate, 13.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;c \cdot \frac{-2}{b + b}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{b + b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (>= b 0.0) (* c (/ -2.0 (+ b b))) (* -0.5 (/ (+ b b) a))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = c * (-2.0 / (b + b));
	} else {
		tmp = -0.5 * ((b + b) / a);
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b >= 0.0d0) then
        tmp = c * ((-2.0d0) / (b + b))
    else
        tmp = (-0.5d0) * ((b + b) / a)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = c * (-2.0 / (b + b));
	} else {
		tmp = -0.5 * ((b + b) / a);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = c * (-2.0 / (b + b))
	else:
		tmp = -0.5 * ((b + b) / a)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(c * Float64(-2.0 / Float64(b + b)));
	else
		tmp = Float64(-0.5 * Float64(Float64(b + b) / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b >= 0.0)
		tmp = c * (-2.0 / (b + b));
	else
		tmp = -0.5 * ((b + b) / a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[GreaterEqual[b, 0.0], N[(c * N[(-2.0 / N[(b + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(N[(b + b), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 6: 67.7% accurate, 13.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{b + b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (>= b 0.0) (/ (- c) b) (* -0.5 (/ (+ b b) a))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = -c / b;
	} else {
		tmp = -0.5 * ((b + b) / a);
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b >= 0.0d0) then
        tmp = -c / b
    else
        tmp = (-0.5d0) * ((b + b) / a)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = -c / b;
	} else {
		tmp = -0.5 * ((b + b) / a);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = -c / b
	else:
		tmp = -0.5 * ((b + b) / a)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(-c) / b);
	else
		tmp = Float64(-0.5 * Float64(Float64(b + b) / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b >= 0.0)
		tmp = -c / b;
	else
		tmp = -0.5 * ((b + b) / a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[GreaterEqual[b, 0.0], N[((-c) / b), $MachinePrecision], N[(-0.5 * N[(N[(b + b), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Reproduce

herbie shell --seed 2023343 
(FPCore (a b c)
  :name "jeff quadratic root 2"
  :precision binary64
  (if (>= b 0.0) (/ (* 2.0 c) (- (- b) (sqrt (- (* b b) (* (* 4.0 a) c))))) (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a))))