数理统计课程作业-计算样本平均值、方差、标准差、顺序统计量和样本中位数的代码

• C++语言，VS2017编译器，Windows环境（只要是C++语言的编译器就可以，linux系统也可以，cygwin虚拟linux系统也可以）。使用时只需要将需要的样本以列的形式粘在一个.txt文档里，然后修改ifstream中文件的地址，就可以一键计算出样本的平均值、方差、标准差、顺序统计量和样本中位数。

#include<iostream>
#include<iomanip>
#include<fstream>
using namespace std;
#include "stdio.h"
#include "stdlib.h"
#include "time.h"
#include "math.h"
#define num_all 30
#define num_lie 1
double pingjun1;
double leijia1;
double pingjun2;
double leijia2;
double S_2_1;
double S_linshi1;
double S_2_2;
double S_linshi2;
double S_1;
double S_2;
double mid_1;
double mid_2;
int mid1;
int mid2;
double huoyunliang[num_all][num_lie];
double keyunliang[num_all][num_lie];
void main()
{
	//pingjunzhi
	FILE *fp1, *fp2;
	int i, j, m, n;
	ifstream ina("D:\\data\\shulitongji\\huoyun.txt");
	ifstream inb("D:\\data\\shulitongji\\keyun.txt");
	for (i = 0; i < num_all; i++)
		for (j = 0; j < num_lie; j++)
			ina >> huoyunliang[i][j];

	for (m = 0; m <num_all; m++)
		for (n = 0; n <num_lie; n++)
			inb >> keyunliang[m][n];
	ina.close();
	inb.close();
	leijia1 = 0;
	leijia2 = 0;
	for (i = 0; i < num_all; i++)
	{
		leijia1 = leijia1 + huoyunliang[i][0];
		leijia2 = leijia2 + keyunliang[i][0];
	}
	pingjun1 = leijia1 / num_all;
	pingjun2 = leijia2 / num_all;
	cout << "第一组数据的平均值：" << pingjun1 << endl;
	cout << "第二组数据的平均值：" << pingjun2 << endl;
	//fangcha
	S_linshi1 = 0;
	S_linshi2 = 0;
	S_2_1 = 0;
	S_2_2 = 0;
	for (i = 0; i < num_all; i++)
	{
		S_linshi1 = (huoyunliang[i][0] - pingjun1)*(huoyunliang[i][0] - pingjun1);
		S_linshi2 = (keyunliang[i][0] - pingjun2)*(keyunliang[i][0] - pingjun2);
		S_2_1 = S_2_1 + S_linshi1;
		S_2_2 = S_2_2 + S_linshi2;
	}
	S_2_1 = S_2_1 / (num_all - 1);
	S_2_2 = S_2_2 / (num_all - 1);
	S_1 = sqrt(S_2_1);
	S_2 = sqrt(S_2_2);
	cout << "第一组数据的方差：" << S_2_1 << endl;
	cout << "第二组数据的方差：" << S_2_2 << endl;
	cout << "第一组数据的标准差：" << S_1 << endl;
	cout << "第二组数据的标准差：" << S_2 << endl;
	//顺序统计量
	for (int i = 0; i < num_all - 1; i++)
	{
		for (int j = 0; j < num_all - i - 1; j++)
		{
			if (huoyunliang[j][0] > huoyunliang[j + 1][0])
			{
				int temp1 = huoyunliang[j][0];
				huoyunliang[j][0] = huoyunliang[j + 1][0];
				huoyunliang[j + 1][0] = temp1;
			}
		}
	}
	for (int i = 0; i < num_all - 1; i++)
	{
		for (int j = 0; j < num_all - i - 1; j++)
		{
			if (keyunliang[j][0] > keyunliang[j + 1][0])
			{
				int temp2 = keyunliang[j][0];
				keyunliang[j][0] = keyunliang[j + 1][0];
				keyunliang[j + 1][0] = temp2;
			}
		}
	}
	cout << "第一组数据顺序排序：" << endl;
	for (i = 0; i < num_all; i++)
	{
		cout << huoyunliang[i][0] << endl;
	}
	cout << "第二组数据顺序排序" << endl;
	for (i = 0; i < num_all; i++)
	{
		cout << keyunliang[i][0] << endl;
	}
	//中位数
	if (num_all % 2 == 0)
	{
		mid1 = num_all / 2 - 1;
		mid2 = num_all / 2;
		mid_1 = (huoyunliang[mid1][0] + huoyunliang[mid2][0]) / 2;
		mid_2 = (keyunliang[mid1][0] + keyunliang[mid2][0]) / 2;
	}
	else if (num_all % 2 != 0)
	{
		mid1 = (num_all - 1) / 2;
		mid_1 = huoyunliang[mid1][0];
		mid_2 = keyunliang[mid1][0];
	}
	cout << "第一组数据的中位数为：" << mid_1 << endl;
	cout << "第二组数据的中位数为：" << mid_2 << endl;
}

• 方法比较笨拙，不过用起来还是挺方便的。里面包含的头文件有一些是用不到的，习惯性的复制粘贴了上去。