Java Utililty Methods List Median

double[] arr = new double[values.size()];
for (int ii = 0; ii < arr.length; ii++) {
    arr[ii] = values.get(ii);
return median(arr);

if (array == null)
    throw new IllegalArgumentException("Array must be non-null");
final int size = array.size();
if (size == 0)
    throw new IllegalArgumentException("Array cannot have size 0");
else if (size == 1)
    return array.get(0);
else {
...

ArrayList<Double> sorted = new ArrayList<Double>(data.size());
for (int i = 0; i < data.size(); i++) {
    sorted.add(data.get(i).doubleValue());
Collections.sort(sorted);
if (sorted.size() % 2 == 1) {
    return sorted.get(sorted.size() / 2);
} else {
...

Collections.sort(list);
int middle = list.size() / 2; 
if (list.size() % 2 == 1) {
    return list.get(middle);
} else {
    return (list.get(middle - 1) + list.get(middle)) / 2.0;

Collections.sort(list);
int i = list.size() / 2;
if (list.size() % 2 == 1)
    return list.get(i);
return (list.get(i) + list.get(i + 1)) / 2;

Double[] b = new Double[p.size()];
int i = 0;
for (Double entry : p) {
    b[i] = entry;
    i++;
Arrays.sort(b);
if (p.size() % 2 == 0) {
...

return interpolateLinearlyQuantile(sortedDataAscendingOrder, 0.50);

Random r = new Random(list.size());
if (0 == (list.size() % 2)) { 
    return (medianHelper(list, list.size() / 2, r) + medianHelper(list, list.size() / 2 + 1, r)) / 2.0;
} else {
    return (double) medianHelper(list, list.size() / 2 + 1, r);

Collections.sort((List) data);
int n = data.size();
return data.get(n / 2);

Collections.sort(data);
return data.get(data.size() / 2);