Java TreeSet getVariance(TreeSet positions)

Description

get Variance

License

Open Source License

Declaration

private static double getVariance(TreeSet<Integer> positions) 

Method Source Code

//package com.java2s;
/*//from   w  w  w. ja  v a 2 s . c o m
 * Copyright (C) 2012 University Wuerzburg, Computer Science VI
 * 
 * This is free software; you can redistribute it and/or modify it under the
 * terms of the GNU Lesser General Public License as published by the Free
 * Software Foundation; either version 3 of the License, or (at your option) any
 * later version.
 * 
 * This software 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 Lesser General Public License for more
 * details.
 * 
 * You should have received a copy of the GNU Lesser General Public License
 * along with this software; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA, or see the FSF
 * site: http://www.fsf.org.
 */

import java.util.TreeSet;

public class Main {
    private static double getVariance(TreeSet<Integer> positions) {
        double average = 0;
        int last = 0;
        for (Integer position : positions) {
            average += position - last;
            last = position;
        }
        average = average / positions.size() - 1;
        double var = 0;
        last = 0;
        for (Integer position : positions) {
            var += Math.abs((position - last) - average);
            last = position;
        }
        return var;
    }
}

Related

1. cvtListToTreeSet(List list)
2. findSizedSubdirs(final String size, final TreeSet themeSubdirs)
3. getDockInsets(final TreeSet set)
4. getTreeSet(Collection collection)
5. getTreeSet(final Object o, final Class classElement)
6. intersection(TreeSet AL1, TreeSet AL2)
7. minDiff(TreeSet numbers)
8. newTreeSet(final Collection c)
9. toTreeSet(Collection lines)