Java List Sort calculateQ1(List values, boolean copyAndSort)

Description

calculate Q

License

Open Source License

Declaration

public static double calculateQ1(List<Double> values, boolean copyAndSort) 

Method Source Code

//package com.java2s;
/**/*w  w w.j av a  2s .  com*/
 * This file is part of SADL, a library for learning all sorts of (timed) automata and performing sequence-based anomaly detection.
 * Copyright (C) 2013-2016  the original author or authors.
 *
 * SADL is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
 *
 * SADL is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License along with SADL.  If not, see <http://www.gnu.org/licenses/>.
 */

import java.util.ArrayList;

import java.util.Collections;

import java.util.List;

public class Main {
    public static double calculateQ1(List<Double> values, boolean copyAndSort) {

        double result = Double.NaN;
        if (values != null) {
            if (copyAndSort) {
                final List<Double> copy = new ArrayList<Double>(values);
                Collections.sort(copy);
                values = copy;
            }
            final int count = values.size();
            if (count > 0) {
                if (count % 2 == 1) {
                    if (count > 1) {
                        result = calcMedian(values, 0, (count - 3) / 2);
                    } else {
                        result = calcMedian(values, 0, 0);
                    }
                } else {
                    result = calcMedian(values, 0, (count / 2) - 1);
                }

            }
        }
        return result;
    }

    private static double calcMedian(List<Double> values, int start, int end) {

        double result = Double.NaN;
        final int count = end - start + 1;
        if (count > 0) {
            if (count % 2 == 1) {
                if (count > 1) {
                    result = values.get(start + ((count - 1) / 2)).doubleValue();
                } else {
                    result = values.get(start).doubleValue();
                }
            } else {
                final Number value1 = values.get(start + ((count / 2) - 1));
                final Number value2 = values.get(start + (count / 2));
                result = (value1.doubleValue() + value2.doubleValue()) / 2.0;
            }
        }
        return result;
    }
}

Related

1. addAllSortNoDuplicates(List l1, List l2)
2. addSorted(final List list, final T element)
3. calculateBox(List values, boolean copyAndSort)
4. descendingSortByCreationTime(List tasks)
5. equalUnsorted(List list1, List list2)
6. extractRankedProducts( List unsortedProducts)
7. formatAsSortUniqCSVString(List s)