排序算法_将管理系统排序·

题目描述

设计并实现一个管理系统（学生管理、图书管理、产品管理等等），系统中需包含1000条以上的记录，系统至少包含以下功能：
(1) 自动生成记录信息（或者从文件中读取）；
(2) 逐条显示所有记录信息；
(3) 利用时间复杂度O(n2)的排序算法（例如直接插入排序或者折半插入排序）按照关键字进行排序；
(4) 利用时间复杂度O(nlogn)的排序算法（例如快速排序）按照关键字进行排序；
(5) 程序中统计（3）和（4）的算法在数据正序、逆序、乱序情况下的比较次数与移动次数并输出，在报告中对比较次数与移动次数进行分析。

提示：以下是本篇文章正文内容，下面案例可供参考

完整代码

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib> 
#include<ctime>
#include<iomanip>
using namespace std;
struct student
{
	int num;
	char name[5];
	int grade;
}a[2000],b[2000],c[2000],d[2000],e[2000],f[2000],g[2000],h[2000];
int stunum;    //学生总数
int cmp2 = 0, mov2 = 0;//乱序
int cmppp2 = 0, movvv2 = 0;//逆序
void Assignment1(student *a,student *b){
	for (int i = 0; i < stunum; i++){
		a[i].num = b[i].num;
		strcpy(a[i].name,b[i].name); 
		a[i].grade = b[i].grade;
	} 
}
void Assignment2(student *a,student *b){
	for (int i = 1; i <=stunum; i++){
		a[i].num = b[i].num;
		strcpy(a[i].name,b[i].name); 
		a[i].grade = b[i].grade;
	} 
} 
void Bubble_sort(student* a)//乱序冒泡排序 
{
	int cmp=0;
	int mov=0;
	for (int i = 1;i < stunum;i++)
	{
		for (int j = 0;j < stunum - i;j++)
		{
			cmp++;
			if (a[j].grade < a[j + 1].grade)
			{
				student tt = a[j];
				a[j] = a[j + 1];
				a[j + 1] = tt;
				mov += 2;
			}
			else if (a[j].grade == a[j + 1].grade)
			{
				cmp++;
				if (a[j].num > a[j + 1].num)
				{
					student tt = a[j];
					a[j] = a[j + 1];
					a[j + 1] = tt;
					mov += 2;
				}
				else if (a[j].num == a[j + 1].num)
				{
					cmp++;
					if (strcmp(a[j].name,a[j + 1].name)>0)
					{
						student tt = a[j];
						a[j] = a[j + 1];
						a[j + 1] = tt;
						mov += 2;
					}
				}
			}
		}
	}
	cout <<setw(10)<<"序号" <<setw(10)<< "学生学号" <<setw(10)<< "学生姓名" <<setw(10)<< "学生成绩" <<endl;
	for (int i = 0;i < stunum;i++)
	cout <<setw(10)<<i + 1<<setw(11)<<a[i].num <<setw(12)<< a[i].name <<setw(12)<< a[i].grade << endl;
	cout << "乱序冒泡排序比较的次数：" << cmp << endl;
	cout << "乱序冒泡排序移动的次数：" << mov << endl;
}
void Bubble_sort_reverse(student* a)//逆序冒泡排序 
{
	int cmp=0;
	int mov=0;
	for (int i = 1;i < stunum;i++)
	{
		for (int j = 0;j < stunum - i;j++)
		{
			cmp++;
			if (a[j].grade > a[j + 1].grade)
			{
				student tt = a[j];
				a[j] = a[j + 1];
				a[j + 1] = tt;
				mov += 2;
			}
			else if (a[j].grade == a[j + 1].grade)
			{
				cmp++;
				if (a[j].num > a[j + 1].num)
				{
					student tt = a[j];
					a[j] = a[j + 1];
					a[j + 1] = tt;
					mov += 2;
				}
				else if (a[j].num == a[j + 1].num)
				{
					cmp++;
					if (strcmp(a[j].name , a[j + 1].name)>0)
					{
						student tt = a[j];
						a[j] = a[j + 1];
						a[j + 1] = tt;
						mov += 2;
					}
				}
			}
		}
	}
	cout <<setw(10)<<"序号" <<setw(10)<< "学生学号" <<setw(10)<< "学生姓名" <<setw(10)<< "学生成绩" <<endl;
	for (int i = 0;i < stunum;i++)
	cout <<setw(10)<<i + 1<<setw(11)<<a[i].num <<setw(12)<< a[i].name <<setw(12)<< a[i].grade << endl;
	cout << "逆序冒泡排序比较的次数：" << cmp << endl;
	cout << "逆序冒泡排序移动的次数：" << mov << endl;
}
void Quick_Sort(student* arr, int begin, int end)//乱序快速排序 
{
	if (begin > end)
		return;
	student tmp = arr[begin];
	int i = begin;
	int j = end;
	while (i != j) 
	{
		while (arr[j].grade <= tmp.grade && j > i)
		{
			cmp2++;
			if (arr[j].grade == tmp.grade && arr[j].num < tmp.num)break;
			j--;
		}
		while (arr[i].grade >= tmp.grade && j > i)
		{
			cmp2++;
			if (arr[i].grade == tmp.grade && arr[i].num > tmp.num)break;
			i++;
		}
		if (j > i) 
		{
			mov2 += 2;
			swap(arr[i], arr[j]);
		}
	}
	arr[begin] = arr[i];
	arr[i] = tmp;
	Quick_Sort(arr, begin, i - 1);
	Quick_Sort(arr, i + 1, end);
}
void Quick_Sort_Reverse(student* arr, int begin, int end)//逆序快速排序 
{
	if (begin > end)
		return;
	student tmp = arr[begin];
	int i = begin;
	int j = end;
	while (i != j)
	{
		while (arr[j].grade >= tmp.grade && j > i)
		{
			cmppp2++;
			if (arr[j].grade == tmp.grade && arr[j].num > tmp.num)break;
			j--;
		}
		while (arr[i].grade <= tmp.grade && j > i)
		{
			cmppp2++;
			if (arr[i].grade == tmp.grade && arr[i].num < tmp.num)break;
			i++;
		}
		if (j > i)
		{
			movvv2 += 2;
			swap(arr[i], arr[j]);
		}
	}
	arr[begin] = arr[i];
	arr[i] = tmp;
	Quick_Sort_Reverse(arr, begin, i - 1);
	Quick_Sort_Reverse(arr, i + 1, end);
}
void System_Interface()
{
	cout << "				<<学生管理系统>>" << endl;
	cout << "请输入需要生成的学生信息数量：" << endl;
	cin >> stunum;
	cout << "显示生成的学生信息:" << endl;
	cout <<setw(10)<<"序号" <<setw(10)<< "学生学号" <<setw(10)<< "学生姓名" <<setw(10)<< "学生成绩" <<endl;
	srand((unsigned)time(NULL));
	for (int i = 0; i < stunum; i++) 
	{
		a[i].num = rand()%(901)+100;
		a[i].name[0] = rand() % 26 + 'a';
		a[i].name[1] = rand() % 26 + 'a';
		a[i].name[2] = rand() % 26 + 'a';
		a[i].grade = rand() % 101;
		cout <<setw(10)<<i + 1<<setw(11)<<a[i].num <<setw(12)<< a[i].name <<setw(12)<< a[i].grade << endl;
		b[i+1].num = a[i].num;
		b[i+1].name[0] = a[i].name[0];
		b[i+1].name[1] = a[i].name[1];
		b[i+1].name[2] = a[i].name[2];
		b[i+1].grade = a[i].grade;
	}
	int choice=-1;
	while(choice!=0){	
	cout<<"----------------------------------------"<<endl;
	cout<<"请选择想要进行的操作："<<endl;
	cout<<"1、乱序冒泡排序"<<endl;
	cout<<"2、乱序快速排序"<<endl;
	cout<<"3、正序冒泡排序"<<endl;
	cout<<"4、正序快速排序"<<endl;
	cout<<"5、逆序冒泡排序"<<endl;
	cout<<"6、逆序快速排序"<<endl;
	cout<<"0、退出排序操作"<<endl;
	cout<<"----------------------------------------"<<endl;
	cin>>choice;
	switch (choice)
	{
	case 1:
		Assignment1(c,a);
		Bubble_sort(c);
		break;
	case 2:
		Assignment2(d,b);
		Quick_Sort(d,1,stunum);
	    cout <<setw(10)<<"序号" <<setw(10)<< "学生学号" <<setw(10)<< "学生姓名" <<setw(10)<< "学生成绩" <<endl;
		for (int i = 1;i <=stunum ;i++)
		cout <<setw(10)<<i << setw(11) << d[i].num << setw(12) << d[i].name << setw(10) << d[i].grade << endl;
		cout << "乱序快速排序比较的次数：" << cmp2 << endl;
		cout << "乱序快速排序移动的次数：" << mov2 << endl;
		break;
	case 3:
		Assignment1(e,a);
		Bubble_sort(e);
		break;
	case 4:
		Assignment2(f,b);
		Quick_Sort(f,1,stunum);
		cout <<setw(10)<<"序号" <<setw(10)<< "学生学号" <<setw(10)<< "学生姓名" <<setw(10)<< "学生成绩" <<endl;
		for (int i = 1;i <= stunum ;i++)
		cout <<setw(10)<<i << setw(11) << f[i].num << setw(12) << f[i].name << setw(10) << f[i].grade << endl;
		cout << "正序快速排序比较的次数：" << cmp2 << endl;
		cout << "正序快速排序移动的次数：" << mov2 << endl;
		break;
	case 5:
		Assignment1(g,a);
		Bubble_sort_reverse(g);
		break;
	case 6:
		Assignment2(h,b);
		Quick_Sort_Reverse(h,1,stunum);
		cout <<setw(10)<<"序号" <<setw(10)<< "学生学号" <<setw(10)<< "学生姓名" <<setw(10)<< "学生成绩" <<endl;
		for (int i =1;i <= stunum ;i++)
		cout <<setw(10)<<i  << setw(11) << h[i].num << setw(12) << h[i].name << setw(10) << h[i].grade << endl;
		cout << "逆序快速排序比较的次数：" << cmppp2 << endl;
		cout << "逆序快速排序移动的次数：" << movvv2 << endl;
		break;
	case 0:
		exit(100);
		break;
	}
}
}
int main()
{
	cout.setf(std::ios::left);
	System_Interface();
	return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274

运行结果

生成数据

乱序冒泡

乱序快排

正序冒泡

正序快排

逆序冒泡

逆序快排