6-4 快速排序分数 10

阿猿收手吧！

已于 2023-12-19 20:26:05 修改

阅读量173

点赞数 1

分类专栏： # C语言经典题目文章标签：算法排序算法数据结构

于 2023-12-14 15:49:49 首次发布

本文链接：https://blog.csdn.net/LHRan_ran_/article/details/134997486

版权

C语言经典题目专栏收录该内容

93 篇文章 4 订阅

订阅专栏

在这里插入图片描述

typedef int Datatype;
typedef struct 
{
	Datatype* elem; 
	int Length;
}SqList;
int Partition(SqList L, int low, int high)
{
	int pivotkey = L.elem[low];

	L.elem[0] = L.elem[low];
	while (low < high)
	{
		while (low < high && L.elem[high] >= pivotkey) 
			--high;
		L.elem[low] = L.elem[high];

		while (low < high && L.elem[low] <= pivotkey)
			++low;
		L.elem[high] = L.elem[low];
	}
	L.elem[low] = L.elem[0];

	return low;
}
void Qsort(SqList  L, int low, int  high)
{
	if (low >= high)
		return;

	int pivotloc = Partition(L, low, high);

	Qsort(L, low, pivotloc - 1);
	Qsort(L, pivotloc + 1, high);
}