数据结构-四种排序算法

        采用记录顺序存储表示，编程实现直接插入排序、快速排序、简单选择排序和堆排序等四种排序算法。

#include <stdio.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define MAXSIZE 20
#define LT(a,b)(a<b)
#define EQ(a,b)(a==b)
typedef int Status;
typedef int KeyType;
typedef int InfoType;

typedef struct {
	KeyType key;
	InfoType otherinfo;
} RedType;

typedef struct {
	RedType r[MAXSIZE + 1];
	int length;
} SqList;

Status InitList(SqList &L) {
	L.length = 0;
	return OK;
}

Status CreateList(SqList &L, int n) {
	int i;
	printf("输出%d个元素：\n", n);
	for (i = 1; i <= n; i++) {
		scanf("%d", &L.r[i].key);
		++L.length;
	}
	return OK;
}

Status DispList(SqList &L) {
	int i;
	if (L.length == 0)
		return ERROR;
	for (i = 1; i <= L.length; i++)
		printf("%d ", L.r[i].key);
	printf("\n");
	return OK;
}

//直接插入排序
void InsertSort(SqList &L) {
	int i, j;
	for (i = 2; i <= L.length; ++i)
		if (LT(L.r[i].key, L.r[i - 1].key)) {
			L.r[0] = L.r[i];//用r[0]先记录r[i]的值
			L.r[i] = L.r[i - 1];//r[i-1]后移一个单元
			for (j = i - 2; LT(L.r[0].key, L.r[j].key); --j)
				L.r[j + 1] = L.r[j];
			L.r[j + 1] = L.r[0];
		}
}

//快速排序
Status Partition(SqList &L, int low, int high) {
	L.r[0] = L.r[low];
	int pivotkey = L.r[low].key;
	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;
}

Status QSort(SqList &L, int low, int high) {
	if (low < high) {
		int pivotloc = Partition(L, low, high);
		QSort(L, low, pivotloc - 1);
		QSort(L, pivotloc + 1, high);
	}
	return OK;
}


//简单选择排序
int SelectMinKey(SqList L, int i) {
	int k = i;
	RedType minn;
	minn = L.r[i];
	for (int j = i; j <= L.length; j++) {
		if (L.r[j].key < minn.key) {
			minn = L.r[j];
			k = j;
		}
	}
	return k;
}

void SelectSort(SqList &L) {
	RedType p;
	for (int i = 1; i <= L.length; i++) {
		int j = SelectMinKey(L, i);
		if (i != j) {
			p = L.r[i];
			L.r[i] = L.r[j];
			L.r[j] = p;//L.r[i]和L.r[j]互换
		}
	}
}
//堆排序
typedef SqList HeapType;

void HeapAdjust(HeapType &H, int s, int m) {
	RedType rc;
	rc = H.r[s];
	for (int j = 2 * s; j <= m; j *= 2) {
		if (j < m && (H.r[j].key < H.r[j + 1].key)) {
			j++;
		}
		if (rc.key >= H.r[j].key)
			break;
		H.r[s] = H.r[j];
		s = j;
	}
	H.r[s] = rc;
}

void HeapSort(HeapType &H) {
	RedType p;
	for (int i = H.length / 2; i > 0; --i)
		HeapAdjust(H, i, H.length);
	for (int i = H.length; i > 1; --i) {
		p = H.r[1];
		H.r[1] = H.r[i];
		H.r[i] = p;
		HeapAdjust(H, 1, i - 1);
	}
}

int main() {
	SqList L;
	int n;
	printf("初始化顺序表，");
	InitList(L);
	if (L.length == 0)
		printf("顺序表为空！\n");
	printf("输入顺序表的元素个数：");
	scanf("%d", &n);
	CreateList(L, n);
	printf("输出%d个元素的顺序表如下：\n", n);
	DispList(L);
	int type;
	printf("选择排序方法：\n1、直接插入排序 2、快速排序 3、简单选择排序 4、堆排序\n");
	scanf("%d", &type);
	if (type == 1) {
		InsertSort(L);
		printf("直接插入排序结果如下：\n");
		DispList(L);
	} else if (type == 2) {
		QSort(L, 1, L.length);
		printf("快速排序结果如下：\n");
		DispList(L);
	} else if (type == 3) {
		SelectSort(L);
		printf("简单选择排序结果如下：\n");
		DispList(L);
	} else if (type == 4) {
		HeapSort(L);
		printf("堆排序结果如下：\n");
		DispList(L);
	}
}