C语言数据结构快速排序（快排）的霍尔、挖坑及前后指针等的介绍

---

前言

C语言数据结构快速排序（快排）的霍尔、挖坑及前后指针等的介绍

---

一、快速排序----Hoare

快速排序定义

void Swap(int* p1, int* p2)
{
	int tmp = *p1;
	*p1 = *p2;
	*p2 = tmp;
}

int GetMidNumi(int* a, int left, int right)
{
	int mid = left + (right - left) / 2;

	if (a[left] < a[mid])
	{
		if (a[mid] < a[right])
		{
			return mid;
		}
		else if (a[left] < a[right])
		{
			return right;
		}
		else
		{
			return left;
		}
	}
	else // a[left] > a[mid]
	{
		if (a[right] < a[mid])
		{
			return mid;
		}
		else if (a[left] < a[right])
		{
			return left;
		}
		else
		{
			return right;
		}
	}

}


// 快速排序
void QuickSort(int* a, int left, int right)
{
	if (left >= right)
		return;
	

	int begin = left, end = right;

	// 随机选K
	//int randi = left + rand() % (right - left);
	//Swap(&a[randi], &a[left]);

	// 三数取中
	int midi = GetMidNumi(a, left, right);
	Swap(&a[midi], &a[left]);

	int keyi = left;

	while (left < right)
	{
		// 右边找小
		while (left < right && a[right] >= a[keyi])
			right--;
		// 左边找大
		while (left < right && a[left] <= a[keyi])
			left++;
		// 交换左右
		Swap(&a[left], &a[right]);
	}
	Swap(&a[keyi], &a[left]);
	
	keyi = left;

	QuickSort(a, begin, keyi - 1);
	QuickSort(a, keyi + 1, end);
}

---

快速排序测试

void TestQuickSort()
{
	int a[] = { 6, 1, 2, 7, 9, 3, 4, 5, 10, 8 };

	PrintArray(a, sizeof(a) / sizeof(a[0]));

	QuickSort(a, 0, sizeof(a) / sizeof(a[0]) - 1);

	PrintArray(a, sizeof(a) / sizeof(a[0]));
}

效果如下：

二、快速排序----挖坑法

快速排序定义

void Swap(int* p1, int* p2)
{
	int tmp = *p1;
	*p1 = *p2;
	*p2 = tmp;
}

int GetMidNumi(int* a, int left, int right)
{
	int mid = left + (right - left) / 2;

	if (a[left] < a[mid])
	{
		if (a[mid] < a[right])
		{
			return mid;
		}
		else if (a[left] < a[right])
		{
			return right;
		}
		else
		{
			return left;
		}
	}
	else // a[left] > a[mid]
	{
		if (a[right] < a[mid])
		{
			return mid;
		}
		else if (a[left] < a[right])
		{
			return left;
		}
		else
		{
			return right;
		}
	}

}


// 快速排序----挖坑法
void QuickSort(int* a, int left, int right)
{
	if (left >= right)
		return;


	int begin = left, end = right;

	// 随机选K
	//int randi = left + rand() % (right - left);
	//Swap(&a[randi], &a[left]);

	// 三数取中
	int midi = GetMidNumi(a, left, right);
	Swap(&a[midi], &a[left]);

	int key = a[left];
	int hole = left;

	while (left < right)
	{
		// 右边找小
		while (left < right && a[right] >= key)
			right--;
		a[hole] = a[right];
		hole = right;
		// 左边找大
		while (left < right && a[left] <= key)
			left++;
		a[hole] = a[left];
		hole = left;
	}
	a[hole] = key;

	QuickSort(a, begin, hole - 1);
	QuickSort(a, hole + 1, end);
}

---

快速排序测试

void TestQuickSort()
{
	int a[] = { 6, 1, 2, 7, 9, 3, 4, 5, 10, 8 };

	PrintArray(a, sizeof(a) / sizeof(a[0]));

	QuickSort(a, 0, sizeof(a) / sizeof(a[0]) - 1);

	PrintArray(a, sizeof(a) / sizeof(a[0]));
}

效果如下：

三、 快速排序----前后指针法

快速排序定义

void Swap(int* p1, int* p2)
{
	int tmp = *p1;
	*p1 = *p2;
	*p2 = tmp;
}

int GetMidNumi(int* a, int left, int right)
{
	int mid = left + (right - left) / 2;

	if (a[left] < a[mid])
	{
		if (a[mid] < a[right])
		{
			return mid;
		}
		else if (a[left] < a[right])
		{
			return right;
		}
		else
		{
			return left;
		}
	}
	else // a[left] > a[mid]
	{
		if (a[right] < a[mid])
		{
			return mid;
		}
		else if (a[left] < a[right])
		{
			return left;
		}
		else
		{
			return right;
		}
	}

}

// 快速排序----前后指针法
void QuickSort(int* a, int left, int right)
{
	if (left >= right)
		return;


	int begin = left, end = right;

	// 随机选K
	//int randi = left + rand() % (right - left);
	//Swap(&a[randi], &a[left]);

	// 三数取中
	int midi = GetMidNumi(a, left, right);
	Swap(&a[midi], &a[left]);

	int keyi = left;

	int prev = left;
	int cur = left + 1;


	while (cur <= right)
	{
		/*if (a[cur] < key)
		{
			prev++;
			Swap(&a[cur], &a[prev]);
		}
		cur++;*/

		if (a[cur] < a[keyi] && ++prev != cur)
			Swap(&a[cur], &a[prev]);
		cur++;
	}
	Swap(&a[prev], &a[keyi]);

	QuickSort(a, begin, prev-1);
	QuickSort(a, prev + 1, end);

}

---

快速排序测试

void TestQuickSort()
{
	int a[] = { 6, 1, 2, 7, 9, 3, 4, 5, 10, 8 };

	PrintArray(a, sizeof(a) / sizeof(a[0]));

	QuickSort(a, 0, sizeof(a) / sizeof(a[0]) - 1);

	PrintArray(a, sizeof(a) / sizeof(a[0]));
}

效果如下：

---

总结

C语言数据结构快速排序（快排）的霍尔、挖坑及前后指针等的介绍