Java Utililty Methods Median

double[] sorted = Arrays.copyOf(unsorted, unsorted.length);
Arrays.sort(sorted);
return median_sorted(sorted);

if (v.length == 3) {
    return median3(copy(v));
} else if (v.length == 5) {
    return median5(copy(v));
} else if (v.length == 7) {
    return median7(copy(v));
} else if (v.length % 2 == 1) { 
    return quickSelect(copy(v), false);
...

if (vals.length == 0) {
    return Double.NaN;
double[] copy = Arrays.copyOf(vals, vals.length);
return nonConstMedian(copy);

double[] a = (double[]) values.clone();
Arrays.sort(a);
int len = a.length;
if (len % 2 == 0) {
    return (a[len / 2 - 1] + a[len / 2]) / 2;
} else {
    return a[(len - 1) / 2];

if (x != null && x.length > 0)
    return median(x, 0, x.length - 1);
else
    return 0.0;

quickSort(x);
int index = (int) Math.floor(0.5 * x.length + 0.5);
if (index < 0)
    index = 0;
if (index > x.length - 1)
    index = x.length - 1;
return x[index];

if (x.length == 1) {
    return x[0];
double[] y = new double[x.length];
System.arraycopy(x, 0, y, 0, x.length);
Arrays.sort(y);
int n = x.length;
double m = ((double) n) / 2.0;
...

double[] flatvalues = new double[values.length * values.length];
for (int i = 0; i < values.length; i++) {
    for (int j = 0; j < values.length; j++) {
        flatvalues[i * values.length + j] = values[i][j];
if (flatvalues.length % 2 == 0)
    return flatvalues[flatvalues.length / 2];
...

if (values.size() % 2 == 1)
    return values.get((values.size() + 1) / 2 - 1);
final long lower = values.get(values.size() / 2 - 1);
final long upper = values.get(values.size() / 2);
return (lower + upper) / 2;

if (in.length == 0) {
    throw new IllegalArgumentException("Attempting to find the median of an empty array");
final double[] data = Arrays.copyOf(in, in.length);
Arrays.sort(data);
final int middle = data.length / 2;
return data.length % 2 == 1 ? data[middle] : (data[middle - 1] + data[middle]) / 2.0;