• Java Program to Calculate Standard Deviation


    In this program, you'll learn to calculate the standard deviation using a function in Java.

    This program calculates the standard deviation of a individual series using arrays. Visit this page to learn about Standard Deviation.

    To calculate the standard deviation, calculateSD() function is created. The array containing 10 elements is passed to the function and this function calculates the standard deviation and returns it to the main() function.

    为了计算标准偏差,创建了calculateSD()函数。将包含10个元素的数组传递给该函数,此函数将计算标准偏差并将其返回给main()函数

    Example: Program to Calculate Standard Deviation

    public class StandardDeviation {
    
        public static void main(String[] args) {
            double[] numArray = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
            double SD = calculateSD(numArray);
    
            System.out.format("Standard Deviation = %.6f", SD);
        }
    
        public static double calculateSD(double numArray[])
        {
            double sum = 0.0, standardDeviation = 0.0;
            int length = numArray.length;
    
            for(double num : numArray) {
                sum += num;
            }
    
            double mean = sum/length;
    
            for(double num: numArray) {
                standardDeviation += Math.pow(num - mean, 2);
            }
    
            return Math.sqrt(standardDeviation/length);
        }
    }
    

    Note: This program calculates standard deviation of a sample. If you need to compute S.D. of a population, return Math.sqrt(standardDeviation/(length-1)) instead of Math.sqrt(standardDeviation/length) from the calculateSD() method.

    When you run the program, the output will be:

    Standard Deviation = 2.872281
    

    In the above program, we've used the help of Math.pow() and Math.sqrt() to calculate the power and square root respectively.

  • 相关阅读:
    Java入门——数组和方法
    Java入门——选择与循环语句
    Java入门——面向对象基础
    十天学会Oracle数据库(Day2)
    Java入门——理解面向对象:UML设计
    十天学会Oracle数据库(Day1)
    Codeforces Round #482 (Div. 2) :B
    Codeforces Round #482 (Div. 2) :C
    Codeforces Round #490 (Div. 3) :F. Cards and Joy(组合背包)
    POJ-2155:Matrix(二维树状数祖)
  • 原文地址:https://www.cnblogs.com/PrimerPlus/p/13022547.html
Copyright © 2020-2023  润新知