function.java

用Java实现的粒子群优化算法

// Decompiled by Jad v1.5.7f. Copyright 2000 Pavel Kouznetsov.
// Jad home page: http://www.geocities.com/SiliconValley/Bridge/8617/jad.html
// Decompiler options: packimports(3) 
// Source File Name:   Function.java

package ci.function;

import java.io.PrintStream;

public final class Function
{

    public static void main(String args[])
    {
        double ad[] = {
            1.0D, 2D, 3D, 4D, 5D
        };
        int i = ad.length;
        double d = average(ad);
        double d1 = minimum(ad);
        double d2 = variance(ad);
        double d3 = maximum(ad);
        System.out.println("len = " + i + "\n" + "average = " + d + "\n" + "minimum = " + d1 + "\n" + "maximum = " + d3 + "\n" + "variance = " + d2 + "\n");
    }

    public static double average(double ad[])
    {
        double d = 0.0D;
        for(int i = 0; i < ad.length; i++)
            d += ad[i];

        return d / (double)ad.length;
    }

    public static double variance(double ad[])
    {
        double d = average(ad);
        double d1 = 0.0D;
        for(int i = 0; i < ad.length; i++)
            d1 += (ad[i] - d) * (ad[i] - d);

        d1 = Math.sqrt(d1);
        return d1 / (double)ad.length;
    }

    public static double minimum(double ad[])
    {
        double d = ad[0];
        for(int i = 0; i < ad.length; i++)
            if(d > ad[i])
                d = ad[i];

        return d;
    }

    public static double maximum(double ad[])
    {
        double d = ad[0];
        for(int i = 0; i < ad.length; i++)
            if(d < ad[i])
                d = ad[i];

        return d;
    }

    public Function()
    {
    }
}