AI.Clustering.Hierarchical.Internal:average from clustering-0.2.1, B

Average Error: 0.02% → 0.02%

Time: 1.9s

Precision: binary64

Cost: 320

Math

\[\frac{x}{y + x} \]

↓

\[\frac{x}{x + y} \]

FPCore

(FPCore (x y) :precision binary64 (/ x (+ y x)))

↓

(FPCore (x y) :precision binary64 (/ x (+ x y)))

C

double code(double x, double y) {
	return x / (y + x);
}

↓

double code(double x, double y) {
	return x / (x + y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x / (y + x)
end function

↓

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x / (x + y)
end function

Java

public static double code(double x, double y) {
	return x / (y + x);
}

↓

public static double code(double x, double y) {
	return x / (x + y);
}

Python

def code(x, y):
	return x / (y + x)

↓

def code(x, y):
	return x / (x + y)

Julia

function code(x, y)
	return Float64(x / Float64(y + x))
end

↓

function code(x, y)
	return Float64(x / Float64(x + y))
end

MATLAB

function tmp = code(x, y)
	tmp = x / (y + x);
end

↓

function tmp = code(x, y)
	tmp = x / (x + y);
end

Wolfram

code[x_, y_] := N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]

↓

code[x_, y_] := N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 0.02

   \[\frac{x}{y + x} \]

2. Final simplification 0.02

   \[\leadsto \frac{x}{x + y} \]

Alternatives

Alternative 1
Error	26.06%
Cost	720

\[\begin{array}{l} \mathbf{if}\;y \leq -7.8 \cdot 10^{+112}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;y \leq -3.9 \cdot 10^{+80}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq -3600000000000:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;y \leq 1050:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \]

Alternative 2
Error	48.7%
Cost	64

\[1 \]

Reproduce

herbie shell --seed 2023102 
(FPCore (x y)
  :name "AI.Clustering.Hierarchical.Internal:average from clustering-0.2.1, B"
  :precision binary64
  (/ x (+ y x)))