C++上机3.2

 

代码

#include<iostream>
#include<string>
using namespace std;
class score {
public:
	score()
	{
		times = 2;
		cout << "学生人数" << endl;
	}
	score(int times1)
	{
		times = times1;
		cout << "自定学生人数" << endl;
	}
	~score()
	{
		cout << "~score" << endl;
	}

	void inputscore()
	{
		for (int i = 0; i < times; i++)
		{
			cout << "请输入学生姓名" << endl;
			cin >> name[i];
			cout << "请输入科目A成绩" << endl;
			cin >> chengji[i][0];
			cout << "请输入科目B成绩" << endl;
			cin >> chengji[i][1];
			cout << "请输入科目C成绩" << endl;
			cin >> chengji[i][2];
		}
	}
	void showscore()
	{
		for (int i = 0; i < times; i++)
		{
			cout << "姓名：" << name[i] << endl;
			cout << "科目A成绩：" << chengji[i][0] << endl;
			cout << "科目B成绩：" << chengji[i][1] << endl;
			cout << "科目C成绩：" << chengji[i][2] << endl;

		}
	}
	void showstuavg()
	{
		for (int i = 0; i < times; i++)
		{
			float avg = 0;
			for (int j = 0; j <= 2; j++)
			{
				avg = avg + chengji[i][j];
			}
			avg = avg / 3;
			cout << name[i] << "同学的平均分：" << avg << endl;
		}
	}
	void showavg()
	{
		float avgA = 0;
		float avgB = 0;
		float avgC = 0;
		for (int i = 0; i < times; i++)
		{
			avgA = avgA + chengji[i][0];
			avgB = avgB + chengji[i][1];
			avgC = avgC + chengji[i][2];
		}
		avgA = avgA / times;
		avgB = avgB / times;
		avgC = avgC / times;
		cout << "科目A的平均分：" << avgA << endl;
		cout << "科目B的平均分：" << avgB << endl;
		cout << "科目C的平均分：" << avgC << endl;

	}
	void paixv()
	{
		float temp;
		for (int i = 0; i <= 2; i++)
		{
			for (int j = 1;j < times;j++)
			{
				if (chengji[j][i] > chengji[j - 1][i])
				{
					temp = chengji[j][i];
					chengji[j][i] = chengji[j - 1][i];
					chengji[j - 1][i] = temp;
				}

			}
			for (int j = 0; j < times; j++)
			{
				cout << chengji[j][i] << " ";
			}
			cout << endl;
		}
	}
private:
	float chengji[100][100];
	int times;
	string name[100];
};
int main()
{
	score x;
	x.inputscore();
	x.showscore();
	x.showstuavg();
	x.showavg();
	x.paixv();
}

 

1、冒泡排序
冒泡排序重复地走访过要排序的元素列，依次比较两个相邻的元素，如果顺序错误就把他们交换过来。走访元素的工作是重复地进行直到没有相邻元素需要交换，也就是说该元素列已经排序完成。

void paixv()
	{
		float temp;
		for (int i = 0; i <= 2; i++)
		{
			for (int j = 1;j < times;j++)
			{
				if (chengji[j][i] > chengji[j - 1][i])
				{
					temp = chengji[j][i];
					chengji[j][i] = chengji[j - 1][i];
					chengji[j - 1][i] = temp;
				}

			}
			for (int j = 0; j < times; j++)
			{
				cout << chengji[j][i] << " ";
			}
			cout << endl;
		}
	}

2、选择排序

选择排序是一种简单直观的排序算法。它的工作原理是：第一次从待排序的数据元素中选出最小（或最大）的一个元素，存放在序列的起始位置，然后再从剩余的未排序元素中寻找到最小（大）元素，然后放到已排序的序列的末尾。以此类推，直到全部待排序的数据元素的个数为零。选择排序是不稳定的排序方法。 

void paixv()
	{

			float temp;
			for (int i = 0; i <= 2; i++)
			{
				for (int j = 0; j < times - 1; j++)
				{
					for (int k = j + 1, biggest = j;k < times;k++)
						if (chengji[k][i] > chengji[biggest][i])
						{
							biggest = k;
							swap(chengji[k][i], chengji[biggest][i]);
						}

				}
				for (int j = 0; j < times; j++)
				{
					cout << chengji[j][i] << " ";
				}
				cout << endl;
			}
	}

3、插入排序

插入排序的算法的工作原理是从左到右逐步构建递增或者递减序列，对于未排序数据，逐步在已排序的数据中找到合适的位置插入。

void paixv()
	{

			float temp;
			for (int i = 0; i <= 2; i++)
			{
				for (int j = 0; j < times - 1; j++)
				{
					if (chengji[j][i] > chengji[j - 1][i])
					{
						temp = chengji[j][i];


						for (j = i - 1; j >= 0 && temp > chengji[j][i];j--)
						{
							chengji[j + 1][i] = chengji[j][i];
						}

						chengji[j][i] = temp;	
					}

					
				}
				for (int j = 0; j < times; j++)
				{
					cout << chengji[j][i] << " ";
				}
				cout << endl;
			}
	}

心得

排序方法经过比较个人认为插入法比较好