交换排序法

1. 冒泡排序

#include<iostream>
using namespace std;
#define MAXSIZE 20
typedef struct {
	int key;
	char* otherinfo;
}ElemType;
//顺序表的存储结构
typedef struct {
	ElemType* r;
	int length;
}SqList;
void BubbleSort(SqList& L)
{
	int m, flag=1;  //flag用来标记某一趟排序是否发生交换
	ElemType t;
	m = L.length - 1;
	while ((m > 0) && flag == 1)
	{
		flag = 0;    //flag置为1，如果本趟排序没有发生交换，则不会执行下一趟排序
		for (int j = 1; j <= m; j++)
		{
			if (L.r[j].key > L.r[j + 1].key)
			{
				flag = 1;    //flag置为1，表示本趟排序发生交换
				t = L.r[j];
				L.r[j] = L.r[j + 1];
				L.r[j + 1] = t;
			}
		}
		m--;
	}
}
void Create_Sq(SqList& L)
{
	int n;
	cout << "请输入数据个数，不超过" << MAXSIZE << "个" << endl;
	cin >> n;
	while (n > MAXSIZE)
	{
		cout << "个数超过上限，不能超过" << MAXSIZE << "，请重新输入" << endl;
		cin >> n;
	}
	cout << "请输入待排序的数据：" << endl;
	for (int i = 1; i <= n; i++)
	{
		cin >> L.r[i].key;
		L.length++;
	}
}
void show(SqList L)
{
	for (int i = 1; i <= L.length; i++)
	{
		cout << L.r[i].key << " ";
	}
	cout << endl;
}
int main()
{
	SqList L;
	L.r = new ElemType[MAXSIZE + 1];
	L.length = 0;
	Create_Sq(L);
	BubbleSort(L);
	cout << "排序后的结果为：";
	show(L);
	return 0;
}

2.快速排序

#include<iostream>
using namespace std;
#define MAXSIZE 20
typedef struct {
	int key;
	char* otherinfo;
}ElemType;
//顺序表的存储结构
typedef struct {
	ElemType* r;
	int length;
}SqList;
int Partition(SqList& L, int low, int high)//对顺序表L中的子表r[low..high]进行一趟排序，返回枢轴位置
{
	int pivotkey;
	L.r[0] = L.r[low];   //用子表的第一个记录做枢轴记录
	pivotkey = L.r[low].key;  //枢轴记录关键字保存至pivotkey中
	while (low < high)  //从表中两端交替地向中间扫描
	{
		while (low < high && L.r[high].key >= pivotkey) 
		{
			high--;
		}
		L.r[low] = L.r[high];   //将比枢轴记录小的记录移到低端
		while (low < high && L.r[low].key <= pivotkey)
		{
			low++;
		}
		L.r[high] = L.r[low];  //将比枢轴记录大的记录移到高端
	}
	L.r[low] = L.r[0];  //枢轴记录到位
	return low;  //返回枢轴位置
}
void QSort(SqList& L, int low, int high) //调用前置初值，low=1;high=L.length;对顺序表L中子序列L.r[low..high]做快速排序
{
	int pivotloc;
	if (low < high)
	{
		pivotloc = Partition(L, low, high);
		QSort(L, low, pivotloc - 1);
		QSort(L, pivotloc + 1, high);
	}
}
void QuickSort(SqList& L)  //对顺序表L做快速排序
{
	QSort(L, 1, L.length);
}
void Create_Sq(SqList& L)
{
	int n;
	cout << "请输入数据个数，不超过" << MAXSIZE << "个" << endl;
	cin >> n;
	while (n > MAXSIZE)
	{
		cout << "个数超过上限，不能超过" << MAXSIZE << "，请重新输入" << endl;
		cin >> n;
	}
	cout << "请输入待排序的数据：" << endl;
	for (int i = 1; i <= n; i++)
	{
		cin >> L.r[i].key;
		L.length++;
	}
}
void show(SqList L)
{
	for (int i = 1; i <= L.length; i++)
	{
		cout << L.r[i].key << " ";
	}
	cout << endl;
}
int main()
{
	SqList L;
	L.r = new ElemType[MAXSIZE + 1];
	L.length = 0;
	Create_Sq(L);
	QuickSort(L);
	cout << "排序后的结果为：";
	show(L);
	return 0;
}