@【数据结构】直接插入排序 、冒泡排序 、简单选择排序 、希尔排序 、快速排序

@【数据结构】（C语言-各类排序函数）

实现排序函数，排序元素个数及元素值键盘输入
1.直接插入排序
2.冒泡排序
3.简单选择排序
4.希尔排序
5.快速排序

主函数：

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#define MAX 100
using namespace std;
typedef int KeyType;  
//typedef int Elemtype;
typedef struct
{
	KeyType key;      //存放关键字

}Elemtype;
typedef struct
{ 
	Elemtype data[MAX+1];   //data[0]单元不存储数据，在排序中作为监测点
	int len;
}Sqlist;
void output(Sqlist L)  //输出函数
{
	for (int i = 1; i <= L.len; i++)
		cout << L.data[i].key << " ";
	cout << endl;
	
}
void main()
{
	int i,n,index,A[20];
	Sqlist L;
	cout << "输入要排序的元素个数：";
	cin >> n;
	L.len = n;
	cout << "请输入元素序列：" << endl;
		for (i = 1; i <= n; i++)
	{
		cin >> L.data[i].key;
		A[i] = L.data[i].key;
	}
	while (1)
	{
		cout << "--------------------------------------------" << endl;
		cout << "1.直接插入排序" << endl;
		cout << "2.冒泡排序" << endl;
		cout << "3.简单选择排序" << endl;
		cout << "4.希尔排序" << endl;
		cout << "5.快速排序" << endl;
		cout << "请选择：";
		cin >> index;
		switch (index)
		{
		case 1:
		{
			insertsort(&L); output(L);
		}break;
		case 2:
		{
			bubblesort(&L); output(L);
		}break;
		case 3:
		{
			SelectSort(&L); output(L);
		}break;
		case 4:
		{
			ShellSort(&L ,A,9);   output(L);
		}break;
		case 5:
		{
			QSort(&L, 1, 9);     
			output(L);
		}break;
		}
	}
	system("pause");

}

有的代码是逆序有的是顺序，根据需要修改符号即可幺
1.直接插入排序

void insertsort(Sqlist *L)
{
	int i, j;
	for (i = 2; i <= L->len; i++)
	{
		if (L->data[i].key < L->data[i - 1].key)
		{
			L->data[0].key = L->data[i].key;
			for (j = i - 1; L->data[0].key < L->data[j].key; j--)
				L->data[j + 1] = L->data[j];   //记录后移
		    L->data[j + 1] = L->data[0];
		
		}
	}
}

2.冒泡排序

void bubblesort(Sqlist *L)
{
	int i, j;
	Elemtype temp;
	for(i=1;i<L->len;i++)
		for(j=1;j<=L->len-i;j++)
			if (L->data[j].key < L->data[j + 1].key)
			{
				temp = L->data[j + 1];
				L->data[j + 1] = L->data[j];
				L->data[j] = temp;
			}
}

3.简单选择排序

void SelectSort(Sqlist *L)
{
	int i, j,k;
	Elemtype temp;
	for (i = 1; i < L->len; i++)
	{
		k = i;
		for (j = i + 1; j <= L->len; j++)   //从i开始的length-i+1个记录中选取
			if (L->data[k].key > L->data[j].key)
				k = j;
		if (k != i)
		{
			temp = L->data[k];
			L->data[k] = L->data[i];
			L->data[i] = temp;
		}

	}
}

4.希尔排序

void ShellInsert(Elemtype data[], int length, int delta)
{
	int i, j;
	for(i=1+delta;i<=length;i++)
		if (data[i].key > data[i - delta].key)
		{
			data[0] = data[i];
			for (j = i - delta; j > 0 && data[0].key > data[j].key; j -= delta)
				data[j + delta] = data[j];
			data[j + delta] = data[0];
		}
}
void ShellSort(Sqlist *L, int delta[], int n)
{
	for (int i = 0; i <= n - 1; i++)
		ShellInsert(L->data, L->len, i);
}

5.快速排序

int part(Elemtype data[], int left, int right)
{
	int low, high;
	low = left; high = right;
	data[0] = data[low];
	int pivo;
	pivo = data[low].key;
	while (low < high)
	{
		while (low < high&&data[high].key >= pivo)
			high--;
		if (low < high)
			data[low] = data[high];
		while (low < high&&data[low].key <= pivo)
			low++;
		if (low < high)
			data[high] = data[low];
	}
	data[low] = data[0];
	return low;
}
void QSort(Sqlist *L,int low,int high)
{
	int pivo;
	if (low < high)
	{
		pivo = part(L->data, low, high);
		QSort(L, low, pivo - 1);
		QSort(L, pivo + 1, high);
	}
}

测试：