commons-statistics-descriptive/src/main/java/org/apache/commons/statistics/descriptive/Quantile.java [363:379]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        final int[] indices = computeIndices(n, p, q, start);

        // Partition
        Selection.select(x, start, end, indices);

        // Compute
        for (int k = 0; k < p.length; k++) {
            // ip in [0, n); i in [start, end)
            final int ip = (int) q[k];
            final int i = start + ip;
            if (q[k] > ip) {
                q[k] = Interpolation.interpolate(x[i], x[i + 1], q[k] - ip);
            } else {
                q[k] = x[i];
            }
        }
        return q;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



commons-statistics-descriptive/src/main/java/org/apache/commons/statistics/descriptive/Quantile.java [552:568]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        final int[] indices = computeIndices(n, p, q, start);

        // Partition
        Selection.select(x, start, end, indices);

        // Compute
        for (int k = 0; k < p.length; k++) {
            // ip in [0, n); i in [start, end)
            final int ip = (int) q[k];
            final int i = start + ip;
            if (q[k] > ip) {
                q[k] = Interpolation.interpolate(x[i], x[i + 1], q[k] - ip);
            } else {
                q[k] = x[i];
            }
        }
        return q;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -